2010/07/23 by Mubashir Husain Rehmani, Aline Carneiro Viana, Rehmani, Mubashir Husain +1
Computer Science · #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Networking and Internet Architecture (cs.NI) #Opportunistic and Delay-Tolerant Networks #cs.NI
paper · pdf · doi:10.48550/arxiv.1007.4068
openalex publication_date 2010/07/23 · arxiv created 2010/07/26 · arxiv updated 2010/07/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this report, firstly, we presents state of the art survey on Data Management and Data Dissemination techniques with Mobile Sink. Moreover we classify these techniques into two ample sub-categories. Under this classification, we identify, review, compare, and highlight these techniques and their pros and cons. We do a SWOT (Strength, Weaknesses, Opportunities, Threats) analysis of each scheme. We also discuss where each scheme is appropriate. Secondly, we presents a new distributed data management scheme which is based upon Random Walk Based Membership Service to facilitate Data Dissemination in Mobile Sink based Wireless Sensor Networks. Our proposed scheme efficiently deals with the aforementioned problems and we also compare the characteristics of our proposed scheme with the state-of-the-art data-dissemination schemes. We propose using Random Walks (RWs) with uniformly distributed views to disseminate data through the WSN with a controlled overhead. This is performed by the use of a Random Walk Based Membership Service - the RaWMS. Our proposal solves then the problems generated when (a) all nodes are storage motes, being no aggregation performed (b) one center node plays the role of storage mote and aggregates data from all the other nodes (c) replication is performed on all nodes in the network. To the best of our knowledge, we are the first to propose an efficient data dissemination approach (in terms of overhead, adaptiveness and representativeness) to allow a mobile sink to gather a representative view of the monitored region covered by n sensor nodes by only visiting any m nodes, where hopefully m << n.