Please use this identifier to cite or link to this item:
Prioritized Efficient Routing for Wireless Ad Hoc Networks
|關鍵字:||wireless ad hoc routing protocol;無線隨意網路路由協定;efficient routing protocol;battery power;flooding control;高效益路由協定;電池能量;洪流控制||出版社:||電機工程學系所||引用:|| Jae-Hwan Chang and L. Tassiulas. Maximum lifetime routing in wireless sensor networks. Networking, IEEE/ACM Transactions on, 12(4):609-619, 2004.  L Chen and W Heinzelman. Network architecture to support qos in mobile ad hoc networks. Proc. Intl. Conf. Multimedia and Expo, vol. 3,June, pages 1715-18, 2004.  L Chen and W Heinzelman. Qos-aware routing based on bandwidth estimation for mobile ad hoc networks. IEEE JSAC, Special Issue on Wireless Ad Hoc Networks, vol. 23, no. 3, Mar, pages 561-72, 2005.  Yi Cui, Yuan Xue, and K. Nahrstedt. A utility-based distributed maximum lifetime routing algorithm for wireless networks. Vehicular Technology, IEEE Transactions on, 55(3):797-805, 2006.  S De. ”trigger-based distributed qos routing in mobile ad hoc networks,”acm sigmobile mobile comp. and Commun. Rev., vol. 6, no. 3, July, pages 22-35, 2002.  David Espes and Zoubir Mammeri. Improvement of AODV routing in dense networks. In Proc. IEEE WoWMoM '07, pages 1-4, 2007.  Y Ge, T Kunz, and L Lamont. Quality of service routing in ad-hoc networks using olsr. Proc. 36th Hawaii Intl. Conf. Sys. Sci, Jan, 2003.  T. Hamma, T. Katoh, B.B. Bista, and T. Takata. An efficient ZHLS routing protocol for mobile ad hoc networks. In Proc.DEXA '06, 2006.  Y.T. Hou, Y. Shi, J. Pan, and S.F. Midkiff. Maximizing the lifetime of wireless sensor networks through optimal Single-Session flow routing. Mobile Computing, IEEE Transactions on, 5(9):1255-1266, 2006.  Y Hwang and P Varshney. An adaptive qos routing protocol with dispersity for ad-hoc networks. Proc. 36th Hawaii Intl. Conf. Sys. Sci, Jan, 2003.  D. Johnson, Y. Hu, and D. Maltz. The dynamic source routing protocol (DSR) for mobile ad hoc networks for IPv4. RCF-4728, IETF, 2007.  M. Khabbazian and V.K. Bhargava. Efficient broadcasting in mobile ad hoc networks. Mobile Computing, IEEE Transactions on, 8(2):231-245, 2009.  H Lim. Flooding in wireless ad hoc networks. Computer Communications, 24:353-363, 2001.  R. Madan and S. Lall. Distributed algorithms for maximum lifetime routing in wireless sensor networks. Wireless Communications, IEEE Transactions on, 5(8):2185-2193, 2006.  Morteza Maleki, Karthik Dantu, and Massoud Pedram. Power-aware source routing protocol for mobile ad hoc networks. In Proc. ACM ISLPED '02, pages 72-75, 2002.  Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu. The broadcast storm problem in a mobile ad hoc network. pages 151-162. ACM, 1999.  Y. Noishiki, H. Yokota, and A. Idoue. Efficient on-demand route establishment methods for dense ad-hoc networks. In Proc. ISADS '05, pages 681-686, 2005.  V. Park and M.S. Corson. Temporally-ordered routing algorithm (TORA) version 1 functional specification. Technical report, Internet-Draft, draft-ietf-manet-tora-spec-00. txt, 1997.  C. Perkins, E. Belding-Royer, and S. Das. Rfc3561: Ad hoc on-demand distance vector (aodv) routing. Internet RFCs, 2003.  K Sanzgiri, I Chakeres, and E Belding-royer. Determining intra-flow contention along multihop paths in wireless networks. Proc. Broadnets 2004 Wireless Networking Symp., San Jose, CA, Oct, 2004.  Y. Sasson, D. Cavin, and A. Schiper. Probabilistic broadcast for flooding in wireless mobile ad hoc networks. pages 1124-1130, March 2003.  P Sinha, R Sivakumar, and V Bharghavan. Cedar: A core-extraction distributed ad hoc routing algorithm. IEEE INFOCOM 99, New York, NY, Mar, 1999.  K. Utsu, Chee-Onn Chow, H. Sano, and H. Ishii. Proposal of load-aware dynamic flooding over ad hoc networks. In Proc IEEE TENCON'09, pages 1-6, 2009.  K Wu and J Harms. Qos support in mobile ad hoc networks. Crossing Boundaries - The GSA J., Univ. of Alberta, vol. 1, no. 1, Nov, 2001.  Yun-Sheng Yen, Hung-Chieh Chang, and Ruay-Shiung Chang. Routing with adaptive path and limited flooding for mobile ad hoc networks. In Proc. Wireless Pervasive Computing, 2006, 2006.||摘要:||
Among various protocols, reactive routing protocols are the most general routing protocols for wireless ad hoc networks. In the reactive routing protocols, due to lack of the centralized control in the wireless ad-hoc network, the dissemination of route request message is achieved by flooding, incurring many redundant transmissions, contention, and collisions. This easily causes the broadcasting storm and performance degradation of the network. However, typical flooding algorithms are developed for optimizing reachability with minimum number of transmission.
If these flooding algorithms are directly applied to route request message dissemination in routing protocols, it is possible to degrade quality of the route found and consequently is not suitable for routing protocol. In this work, the prioritized efficient routing protocol (PER) is proposed for the purpose of finding a better quality route with requiring less overhead.
In the simulation, average and the least remaining batter power of the selected route are greatly improved as compared with that by the traditional methods. Meanwhile, PER could save up to 50% transmissions of route request message as well as maintaining the same quality by applying the prioritized flooding control.
Moreover, the route initial delay and collisions are reduced by the adaptive listening windows and the prioritized jittering. From the simulation results, it shows that PER can provide excellent performance in the overhead-sensitive environment, such as high density, large scale wireless ad hoc networks or the energy efficient networks.
|Appears in Collections:||電機工程學系所|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.