Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Performance analysis of opportunistic broadcast for delay-tolerant wireless sensor networks
Nayebi A., Sarbazi-Azad H., Karlsson G. Journal of Systems and Software83 (8):1310-1317,2010.Type:Article
Date Reviewed: Nov 8 2010

Imagine that there is an interplanetary Internet (IPN) between Earth and Mars. The shortest distance between Earth and Mars is 100 million kilometers (km). With the speed of light, a signal will take about 667 seconds round trip. The current Internet protocol depends heavily on the round-trip time for its flow control and congestion control. Such a large round-trip delay makes the current protocol unworkable. Therefore, we have to devise a new kind of protocol that is tolerant of this long delay. Hence, what we need for an IPN is a delay-tolerant network (DTN).

The IPN was first studied by some Internet pioneers, including Vint Cerf. An IPN special interest group was formed under the Internet Society (ISOC). It is obvious that without support from the Pentagon and the National Aeronautics and Space Administration (NASA), the IPN would not be possible. The recent worldwide economic downturn and budget cuts make the IPN a very low priority, so it is safe to say that the IPN project has been indefinitely postponed.

Without real application scenarios, a DTN begins to find its way into other domains. This paper applies the DTN concept to wireless sensor networks (WSNs)--delay-tolerant WSNs (DTWSNs). It studies problems related to routing, data gathering, and neighbor discovery, within the scope of DTWSNs. A simple opportunistic broadcast algorithm is proposed, analyzed, and simulated. However, in the first step of the algorithm, a mobile node frequently and synchronously turns on and sends query packets. What does “synchronously” mean? The term is never mentioned again in the paper.

The paper does not refer to two requests for comments (RFC) about architecture and protocols for DTN that are closely related to this paper and the opportunistic broadcast algorithm (RFC4838 and RFC5050). Furthermore, the assumption that each sensor node must buffer all the data from other sensor nodes faces the problem of memory overflow. This should be considered and dealt with.

Apart from the comments above, this well-written paper is easy to follow and understand.

Reviewer:  R. S. Chang Review #: CR138565 (1105-0505)
Bookmark and Share
  Featured Reviewer  
 
Sensor Networks (C.2.1 ... )
 
 
Internet (C.2.5 ... )
 
 
Stochastic Processes (G.3 ... )
 
 
Wireless Communication (C.2.1 ... )
 
 
Network Architecture And Design (C.2.1 )
 
 
Network Protocols (C.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Sensor Networks": Date
Heartbeat of a nest: using imagers as biological sensors
Ko T., Ahmadian S., Hicks J., Rahimi M., Estrin D., Soatto S., Coe S., Hamilton M. ACM Transactions on Sensor Networks 6(3): 1-31, 2010. Type: Article
Jan 10 2011
Efficient clustering-based data aggregation techniques for wireless sensor networks
Jung W., Lim K., Ko Y., Park S. Wireless Networks 17(5): 1387-1400, 2011. Type: Article
May 8 2012
Randomized data-gathering protocol for time-driven sensor networks
Galmés S., Puigjaner R. Computer Networks 55(17): 3863-3885, 2011. Type: Article
Dec 6 2012
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