Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Decentralised peer-to-peer data dissemination in wireless sensor networks
Carbajo R., Mc Goldrick C. Pervasive and Mobile Computing40  242-266,2017.Type:Article
Date Reviewed: Dec 8 2017

Can edge sensor data reliably route through unreliable networks using a unique decentralized routing framework? New research describes how using a framework of peer-to-peer (P2P) wireless sensor networks (WSNs). WSNs are characterized as small, low power, low data rate wireless devices, forming the edge sensors in a network. Disseminating that information through a decentralized framework starts by using ubiquitous mobile gradient (UMG) routing. This forms the foundation of the authors’ TinyTorrents (TT) overlay approach.

The authors take the reader from a centralized implementation of their TT framework to an even more challenging decentralized solution. They explain how they can scale and reliably distribute sensor data. In particular, they use P2P approaches, which self-organize and communicate node-to-node through a range of protocols. Their own TT protocol sits on top of the gradient-based reactive routing protocol, UMG. With these, an overlay is created for reliable and efficient multi-hop routing for sensor data dissemination.

As the authors state, instead of reliably sending data through preestablished routes, they provide selective data dissemination to a sub(set) of consumers though a traffic load balancing collaborative manner. They use P2P for a set of self-organizing communicating devices. Through structured P2P with virtual overlays, they can use distributed hash table (DHT) schemes.

Through TT and P2P content distribution such as BitTorrent, the paper then goes into great detail on their UMG routing mechanism. UMG is address centric to represent the nodes. This also supports data-centric routing using Bloom filters. Essentially, UMG acts as a service advertisement protocol that is shared across the continually changing network.

The paper addresses scalability and performance through simulations and extensive execution across various 64-node topology layouts. The results are nicely described and also compared to other WSN dissemination protocols. The research results from this paper are a valuable contribution to mobile networking challenges.

Reviewer:  Scott Moody Review #: CR145700 (1802-0078)
Bookmark and Share
  Featured Reviewer  
 
Peer-to-Peer Computing (C.2.1 ... )
 
 
Sensor Networks (C.2.1 ... )
 
 
Wireless Communication (C.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Peer-to-Peer Computing": Date
Peer-assisted view-dependent progressive mesh streaming
Cheng W., Liu D., Ooi W.  MM 2009 (Proceedings of the 17th ACM International Conference on Multimedia, Beijing, China, Oct 19-24, 2009)441-450, 2009. Type: Proceedings
May 12 2010
Caching P2P traffic: What are the benefits for an ISP?
Carlinet Y., Debar H., Gourhant Y., Mé L.  ICN 2010 (Proceedings of the 2010 9th International Conference on Networks, Menuires, The Three Valleys, French Alps, France, Apr 11-16, 2010)376-383, 2010. Type: Proceedings
Mar 3 2011
Benefit based cache data placement and update for mobile peer to peer networks
Ye F., Li Q., Chen E. World Wide Web 14(3): 243-259, 2011. Type: Article
Jun 30 2011
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy