Wassim El-Hajj
ABSTRACT
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, etc. For such ad hoc networks to fulfill their mission in a timely manner, they should be able to establish a connection between nodes and to maintain this connection until the communication halts. Establishing a connection is achieved by using a routing protocol, and maintaining it is achieved by having a resilient fault tolerant network. In this paper, we propose a network design scheme that incorporates these features. We first propose a special network topology that is unique in terms of how nodes are interconnected. After constructing the initial topology, we propose a distributed routing protocol that allows any two sites to communicate by traversing at most 2 nodes regardless of the network size. We conducted both simulation study and theoretical analysis; the results show that the proposed scheme is resilient to network dynamics and has high quality as well as efficient routing.
- C. P. Low and Y. J. Lee. Distributed multicast routing with end-to-end delay and delay variation constraints. Computer Communications, 24(9):848--862, 2000. Google Scholar
Digital Library
- Perkins, C. E., Royer, E. M., and Das, S. R. Ad hoc on-demand distance vector routing. IETF Draft, October 1999.Google Scholar
- Johnson, D., and Maltiz, D. Dynamic source routing in ad hoc wireless networks. Mobile Computing, T. Imelinsky and H. Korth, Eds. Kluwer Academic Publishers, pages 153--181, 1996.Google Scholar
- Royer, E. M., AND Toh, C. K. A review of current routing protocols for ad hoc mobile wireless networks. IEEE Personal Communications, pages 46--55, 1999.Google Scholar
- V. D. Park and M. S. Corson. A highly adaptive distributed routing algorithm for mobile wireless networks. Proc. IEEE INFOCOM, 3:1405--1413, Japan, April 1997. Google ScholarDigital Library
- TOH, C.-K. A novel distributed routing protocol to support ad hoc mobile computing. Proc. 1996 IEEE 15th Annual Int'l. Phoenix Conf. Comp. and Commun., pages 480--486, March 1996.Google Scholar
- TOH, C.-K. Long-lived ad-hoc routing based on the concept of associativity. IETF Internet Draft, March 1999.Google Scholar
- M. Maekawa. A √N algorithm for mutual exclusion in decentralized systems. In ACM Trans. Computer Systems, 3(2):145--159, May 1985. Google ScholarDigital Library
- J. Wu. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. Journal of Communications and Networks, 4(1):59--70, March 2002.Google ScholarCross Ref
- J. Shaikh, J. Solano, I. Stojmenovic, and J. Wu. New metrics for dominating set based energy efficient activity scheduling in ad hoc networks. Proc. of WLN Workshop (in conjunction to IEEE Conference on Local Computer Networks), pages 726--735, October 2003. Google ScholarDigital Library
- J. Wu, M. Gao, and I. Stojmenovic. On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks. Proc. of International Conference on Parallel Processing (ICPP), pages 346--356, 2001. Google ScholarDigital Library
- J. Wu and B. Wu. A transmission range reduction scheme for power-aware broadcasting in ad hoc networks using connected dominating sets. Proc. of 2003 IEEE Semiannual Vehicular Technology Conference (VTC2003-fall), October 2003.Google Scholar
- J. Wu, B. Wu, and I. Stojmenovic. Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Proc. of IASTED International Conference on Wireless and Optical Communication (WOC 2002), 2002.Google Scholar
- J. Wu, B. Wu, and I. Stojmenovic. Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets. Wireless Communications and Mobile Computing, a special issue on Research in Ad Hoc Networking, Smart Sensing, and Pervasive Computing, 3(4):425--438, June 2003.Google Scholar
Index Terms
- On fault tolerant ad hoc network design
Recommendations
HSG-ad hoc network: A novel hierarchical star graph ad hoc network with self-organization and routing discovery free
In ad hoc wireless networks, most data are delivered by multi-hop routing (hop by hop). This approach may cause long delay and a high routing overhead regardless of which routing protocol is used. To mitigate this inherent characteristic, this work ...
Providing Fault-Tolerant Ad hoc Routing Service in Adversarial Environments
Most existing designs of ad hoc networks are based on the assumption of non-adversarial environments, where each node in the network is cooperative and well-behaved. When misbehaving nodes exist in the network, the performance of current routing ...
Impact of mobility on bypass AODV protocol in mobile ad hoc network
WINITS '07: The First International Workshop on Wireless Networking for Intelligent Transportation SystemsThe creation of highly reliable routing protocol for wireless vehicular ad hoc networking (VANET) presents a real challenge to the wireless community. Recently, a Bypass-AODV [1] mechanism is proposed to enhance the performance of standard AODV by ...
Comments