Please use this identifier to cite or link to this item:
標題: 利用動態群聚建立方式以電量消秏的繞送演算法
Uniform Power Distribution Routing Scheme for Long-Lived Traffic by On-demand Clustering on MANET
作者: 杜建志
Tu, Chien-Chih
關鍵字: ad hoc
on-demand clustering
出版社: 資訊科學系所
引用: [1].E. M. Belding-Royer, “Multi-Level Hierarchies for Scalable Ad hoc Routing”, In ACM Wireless Networks 9, pp. 461-478, 2003. [2].R. V. Boppana and S. P. Konduru, “An Adaptive Distance Vector Routing Algorithm,” in Pro. IEEE INFOCOM 2001. [3].J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu and J. Jetcheva, “A performance comparison of multi-hop wireless ad hoc network routing protocols,” in Proc. of MOBICOM Oct. 1998 [4].A. Boukerche, ” Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks,” in Mobile Networks and Applications Vol. 9 , Issue 4 , pp. 333 - 342 , Aug. 2004. [5].T. H. Clausen, G. Hansen, L. Christensen, G. Behrmann, “The Optimized Link State Routing Protocol Evaluation through Experiments and Simulation,” In Pro. IEEE Symposium on Wireless Personal Mobile Communications 2001. [6].C. Carter, S. Yi, P Ratanchandani, R Kravets, “Manycast: Exploring the Space Between Anycast and Multicast in Ad Hoc Networks”, In Proc. ACM MobiCom, September 2003. [7].C.-C. Chiang, H.-K. Wu, W. Liu, M. Gerla, “ROUTING IN CLUSTERED MULTIHOP, MOBILE WIRELESS NETWORKS WITH FADING CHANNEL”, In Proceedings of IEEE Singapore International Conference on Networks (SICON) , April 1997, pp. 197-211. [8].Douglas S. J. DE Couto, D. Aguayo, J Bicket, R Morris, “A High-Throughput Path Metric for Multi-Hop Wireless Routing”, In Proc. ACM MobiCom, September 2003. [9].M. R. Gosnell, R. Albarelli, Maggie X. Cheng and B. McMillin, “Energy Balanced Broadcasting Through Delayed Intelligence,” In Pro. IEEE International Conference on Information Technology : Coding and Computing (ITCC) 2005. [10].C. Gui and p. Mohapatra, “SHORT: Self-Healing and Optimizing Routing Techniques “, In Proc. ACM MobiHoc June 2003. [11].M. Gerla, T. Kwon, and G. pei, “On Demand Routing in Large Ad Hoc Wireless Networks with Passive Clustering,” In Pro. IEEE WCNC, Sep. 2000. [12].D.-F. Henri, M. Grossglauser, M. Vetterli, “Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks”, In Proc. ACM MobiHoc 2003. [13].Z. J. Haas, Marc R. Pearlman, Prince Samar ,“The zone routing protocol (ZRP) for ad hoc networks,” IETF , MANET Internet Draft, July 2002 [14].D. B. Johnson and D. A. Maltz, “Dynamic source routing (DSR) in ad hoc wireless networks,“ In Mobile Computing (Kluwer Academic, 1996) chapter 5, pp. 153-181. [15].M. Jiang, J. Li and Y.C. Tay, “Cluster based routing protocol (CBRP),” IETF MANET Working Group, Internet-Draft , Aug. 1999. [16].David B. Johnson, David A. Maltz, and Josh Broch. “DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” in Ad Hoc Networking, edited by Charles E. Perkins, Chapter 5, pp. 139-172, Addison-Wesley, 2001. [17].V. Kawadia and P. R. Kumar, “Power Control and Clustering in Ad Hoc Networks,” in Proc. IEEE INFOCOM 2003. [18].T.-J. Kwon and M. Geria, “Efficient Flooding with Passive Clustering (PC) in Ad Hoc Networks,” In ACM SIGCOMM Comput. Commun. Rev., vol. 32, no. 1, pp. 44-56, 2002. [19].C. R. Lin and M. Gerla, ”Adaptive Clustering for Mobile Wireless Networks,” in IEEE Journal on selected areas in communications, Vol. 15, No 7, Sep. 1997. [20].B. Liang and Z. J. Haas, “Hybrid Routing in Ad Hoc Networks with a Dynamic Virtual Backbone,” to appear in the IEEE Transactions on Wireless Communications. [21].S. Narayanaswamy, V. Kawadia, R. S. Sreenivas and P. R. Kumar, “Power Control in Ad-Hoc Networks: Theory, Architecture, Algorithm and Implementation of the COMPOW Protocol,” in Pro. European Wireless 2002. [22].D. Niculescu and B. Nath, “Trajectory Based Forwarding and Its Applications ,“ In Proc. ACM MobiCom Sep. 2003. [23].D. Niculescu and B. Nath, “Localized Positioning in Ad Hoc Networks,” In IEEE Sensor Network Protocols and Applications, Anchorage, Alaska, April 2003. [24].C. E. Perkins and P. Bhagwat, “Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers,” In Proceedings of the SIGCOMM '94 Conference on Communications Architectures, Protocols and Applications, pp. 234-244, August 1994. [25].C. E. Perkins, E. M. Belding-Royer, and I. Chakeres, "Ad Hoc On Demand Distance Vector (AODV) Routing," IETF Internet draft, draft-perkins-manet-aodvbis-00.txt, Oct 2003. [26].C.-C. Shen, C. Srisathapornphat, R. Liu, Z. Huang, C. Jaikaeo and E. L. Lloyd, “CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks,” in IEEE TRANSACTIONS ON MOBILE COMPUTING, Vol. 3, No 1, Jan.-March 2004. [27].P. Samar, M. R. Perlman, Z. J. Hass, “Independent Zone Routing: An Adaptive Hybrid Routing Framework for Ad Hoc Wireless Networks,” In IEEE/ACM TRANSACTIONS ON NETWORKING, Vol. 12, No. 4, Aug. 2004. [28].J. Tenhunen, V. Typpö, M. Jurvansuu , “Stability-Based Multi-Hop Clustering Protocol,” PIMRC, The 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications, Berlin, Germany, Sep. 2005 [29].G. Venkataraman, S. Emmanuel and S. Thambipollai, “A Novel Distributed Cluster Maintenance Technique for High Mobility Ad-hoc Networks,” in Proc. IEEE, First International Symposium of Wireless Communication Systems (ISWCS 2004), Mauritius, pp125 - 129,20-22 Sep. 2004 [30].G. Wang and G. Cho, “An on-demand cluster formation scheme for efficient flooding in ad-hoc networks,” IEICE TRANS. COMMUN., VOLE88-B, NO. 9 September 2005. [31].O. Younis and S. Fahmy, “Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach,” In Pro. IEEE INFOCOM, March 2004, an extended version appears in IEEE Transactions on Mobile Computing, vol. 3, issue 4, Oct-Dec, 2004. [32].R. Zheng, R. Kravets, “On-demand Power Management for Ad Hoc Networks ,“ in Proc. IEEE INFOCOM 2003
摘要: 近年來無線網路技術非常熱門,隨著無線技術的進步,各種不同的應用相繼被提出,其中應用在區域網路上之無線特設網路為近來熱門的討論議題。當無線特設網路應用在移動性節點上即稱為移動性無線特設網路。 移動性無線特設網路應用非常廣,但因其電量有限,充電不易因此無線特設網的電量議題近來被熱烈討論。因為無線網路不似有線網路穩定,其依靠空氣為煤介作傳播,因此非常容易掉封包,所以除了電量之外也必須考量到網路傳輸的效能,如封包送達率,平均網路負載量。 此篇論文網將對電量消秏這點提出一個能平均分散電量消秏的機制我們稱其UDPOC,UDPOC可以平均分散電量消秏使得每個節點均能存活較久,以避免某個重要的中間節點死亡而導致資料流無法再繼續傳輸。除了達到省電的目地,附帶的也提升了整體的封包送達率。 在最後實驗數據中可以看出UDPOC降低了多餘的封包傳送而達成省電的目地,並且降低了整體的網路負載量。此外UDPOC中包含許多機制均可分別拿出應用於其他的繞路機制,並使其效能提升。
During the past few years, the dramatic improvement of networking technology has driven many new networking topologies, like the mobile ad hoc network. A mobile ad hoc network is a collection of autonomous mobile nodes that communicate with each other over wireless links and form a wirless local area network Nodes in Mobile ad hoc network are energy limited and are not easy to re-charged in outdoor environment. As a result, energy issue in mobile ad hoce network is a very hot research topic recently. Furthermore, in contrast to the wired network, wireless network is extremely unstable and it is common to loss packet due to the noisy wireless environment. Thus, in addition to prolong mobile node's life time, packet delivery ratio and load balancing are also important isues for many mobile ad hoc network applications. In this thesis, we provide a routing scheme called UDPOC to uniformly distribute power consumption between nodes in mobile ad hoc network. As a result, our proposed UDPOC scheme prolong the lifetime of each node in the wireless ad hoc network. Consequently, UDPOC can also prolong the lifetime of each data flow in network. From the simulation result, our UDPOC scheme reduce unnecessary packet transfer and save the energy while increasing the packet delivery ratio and decreasing the load of network. Furthermore, the schemes proposed in UDPOC can also be applied in other routing protocols.
其他識別: U0005-0308200615435200
Appears in Collections:資訊科學與工程學系所



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.