Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
The impact of transient traffic on mobile, ad-hoc routing
Cai K., Feeley M., Hutchinson N.  Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks (Proceedings of the 2nd ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks, Montreal, Quebec, Canada, Oct 10-13, 2005)189-196.2005.Type:Proceedings
Date Reviewed: Jan 16 2006

Ad hoc public wireless networks deal with transient traffic patterns. Sporadically evaluating the performance of ad hoc network routing protocols via simulation amid synthetic workloads lacks credibility. This is due to the scarce investigation of discontinuous routes originating from mobility or congestion [1]. In particular, simulations sometimes do not accentuate the costs of discovering routes. An effective ad hoc packet routing tactic should spawn less frequent route discovery than long-term communication to circumvent flooding a network.

Piggybacking, timestamping, and layered routing are valuable strategies for reducing overheads of protocols, improving the packet delivery ratio, and minimizing network congestion and interference. Setting the appropriate heartbeat frequency and the number of routes for piggybacking a reply message in high-mobility networks is nontrivial. The tradeoffs between the speed of topological change propagation and protocol overheads must be objectively weighed. The authors of this paper have developed a valuable hybrid backbone routing protocol (BRP) for both short- and long-term network traffic. The BRP piggybacks information on each route-discovery reply message to prefetch routes for multiple nodes, applies timestamps to route-cache entries, and dynamically modifies inter-backbone-node links using proactive local route adaptation and recovery without altering global caches of routes or dropping packets. The novel BRP applies a backbone topology to resourcefully improve route-!cache and frequency of route discovery.

The BRP was evaluated by using a collection of 200 randomly distributed nodes in an area of 1500-by-750 meters that was designed to eliminate the formation of chain-like backbones. Concurrent continuous bit rate traffic connections with varying durations at each connection were used to simulate the mobility of the short- and long-term traffic network loads. The performance of both small and large dynamic source routing protocols was assessed alongside two versions of the hierarchical protocol developed by the authors. Incredible results and recommendations came from the simulation experiments, including the capacity to improve broadcast efficiency by modifying control messages operating in promiscuous mode at specific network nodes, the importance of scaling the lifetime duration of traffic connections, and the substance of varying short-time connections at hot spots.

Reviewer:  Amos Olagunju Review #: CR132310 (0611-1149)
1) Hassan, M.; Jain, R. High performance TCP/IP networking concepts, issues and solutions. Pearson Education, Inc., Upper Saddle River, NJ, 2004.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Performance Attributes (C.4 ... )
 
 
Wireless Communication (C.2.1 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Performance Attributes": Date
Attributes of the performance of central processing units: a relative performance prediction model
Ein-Dor P., Feldmesser J. Communications of the ACM 30(4): 308-317, 1987. Type: Article
Jul 1 1988
Performance estimation of computer communication networks: a structured approach
Verma P., Computer Science Press, Inc., New York, NY, 1989. Type: Book (9789780716781837)
Jun 1 1990
Computer hardware performance: production and cost function analyses
Kang Y. Communications of the ACM 32(5): 586-593, 1989. Type: Article
Feb 1 1990
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