在這篇論文之中，考慮剩餘電池能量的因素，設計了 DER 演算法，讓電池 量的消耗可以平均地分佈在網路中。藉由這種方式，讓網路中的行動運算節點 以維持比較長的壽命，讓網路中的擇路節點都可以正常的運作。在觀察模擬結 之後，儘管 DER 演算法必須犧牲一點資料封包的延遲時間，但可以提供較高 封包傳遞成功率，但卻有 RREQ 封包增加許多的問題。另外還考量群組移動 式與平均接收功率的因素，發展出 PCHMR 演算法，增加一定數量的路徑幫忙 輸，提高資料封包在傳送時的可靠性。由模擬結果可以發現，PCHMR 演算法 以提高資料封包的傳送成功率，卻反而不會產生更多的控制封包，使整個網路 效能都提升。
能 可 果 的 模 傳 可 的
參考文獻
[1] Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications
] Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) ecifications: Higher-Speed Physical Layer Extension in the 2.4 GHz Band igh-speed
ireless LAN Medium Access Control (MAC) and Physical Layer (PHY) cal Layer in the 5 GHZ Band
] Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) ecifications Amendment 4: Further Higher Data Rate Extension in the 2.4 GHz and
5] C. E. Perkins and P. Bhagwat, ”Highly Dynamic Destination Sequence Distance puters,” Proceedings of the ACM Conference, Aug. 1994, pp. 234-244.
es, ”An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks Appl. J., Special Issue on Routing in
obile Communication Networks, Oct. 1996, pp. 183-197.
[7] C. E. Perkins and E. M. Royer, ”Ad-hoc On-demand Distance Vector Routing,”
eb. 1999, pp. 90-100.
[2 sp H
[3] Part 11: W
specifications: High-speed Physi
[4 sp B
[
Vector (DSDV) Routing for Mobile Com SIGCOMM ’94
[6] S. Murthy and J. J. Garcia-Luna-Acev M
Proceedings of the Second IEEE Workshop on Mobile Computing Systems and Applications, F
[8] D. B. Johnson, D. A. Maltz, and J. Broch, ”DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks,” Ad Hoc Networking, edited by C.
[9] V. D. Park and M. S. Corson, ”A Highly Adaptive Distributed Routing Algorithm
[10] V. D. Park and M. S. Corson, ”Temporally-Ordered Routing Algorithm (TORA)
[11] C.-K. Toh, ”A novel Distributed Routing Protocol to Support Ad-hoc Mobile
[12] R. Dube, C. D. Rais, K. Y. Wang, and S. K. Tripathi, ”Signal Stability Based
[13] Z. J. Haas and M. R. Pearlman, "The Performance of Query Control Schemes for IEEE/ACM Trans. Networking, vol.9, no.4, Aug. 2001, E. Perkins, Addison-Wesley, 2001.
for Mobile Wireless Networks,” Proceedings of IEEE Infocom ’97, Apr. 1997, pp.
1405-1413.
version 1: Furrctiod specification” Internet-Draft, draft-ietf-rnanet-tora-spec-00.txt, Nov. 1997.
Computing”, Proceedings of 15th IEEE Annual International Phoenix Conference on Computers and Communications, Mar. 1996, pp. 480-486.
Adaptive Routing (SSA) for Ad-hoc Mobile Networks,” IEEE Personal Communications, Feb. 1997, pp. 36-45.
the Zone Routing Protocol,"
pp. 427-438.
[14] P. Samar, M. R. Pearlman, and Z. J. Haas, "Hybrid Routing: The Pursuit of an Adaptable and Scalable Routing Framework for Ad Hoc Networks," in The Handbook of Ad Hoc Wireless Networks, Boca Raton, FL: CRC Press, 2003.
[15] C. C. Chiang, H. K. Wu, W. Liu, and M. Gerla, "Routing in Clustered Multihop, Mobile Wireless Networks with Fading Channel," Proceedings of IEEE SICON '97, Apr. 1997, pp. 197-211.
[16] A. Iwata, C. C. Chiang, G. Pei, M. Gerla, and T. W. Chen, "Scalable Routing Strategies for Ad Hoc Wireless Networks," IEEE Journal on Selected Areas in Communication, vol.17, no.8, Aug. 1999, pp. 1369-1379.
[17] R. Sivahumar, P. Sinha, and V. Bharghavan, "CEDAR: a Core-Extraction Distributed Ad hoc Routing Algorithm," IEEE Journal on Selected Areas in Communication, vol.17, no.8, Aug. 1999, pp. 1454-1465.
f the ACM/IEEE International Conference on Mobile Computing and Networking, Oct. 1998, pp. 25-30.
rative Performance Analysis," Proceedings of the ACM/IEEE International Conference on Mobile
. Toh, "A Review of Current Routing Protocols for Ah-hoc Mobile Wireless Networks," IEEE Personal Communication Magazine, Apr. 1999.
[21] S. R. Das, R. Castaneda, J. Yan, and R. Sengupta, "Comparative Performance
[23] S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, "A Distance [18] J. Borch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, "A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,"
Proceedings o
[19] P. Johansson, T. Larsson, N. Hedman, B. Mielczarek, and M. Degermark,
"Routing Protocols for Mobile Ad-Hoc Networks - A Compa Computing and Networking, Aug. 1999, pp. 195-206.
[20] E. R. Royer and C. K
Evaluation of Routing Protocols for Mobile, Ad hoc Networks," Proceedings of the International Conference on Computer Communications and Networks (ICCCN), 1998, pp. 153-161.
[22] B. Parkinson and S. Gilbert, "NAVSTAR: Global Positioning System - Ten Years Later," Proceedings of IEEE, Oct. 1983, pp. 1177-1186.
Routing Effect Algorithm for Mobility (DREAM)," Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, October 1998, pp.76-84.
[24] Y. B. Ko and N. H. Vaidya, "Location-Aided Routing (LAR) in Mobile Ad Hoc Networks," ACM Wireless Networks Journal, vol.6, no.4, 2000, pp. 307-321.
[25] R. Jain, A. Puri, and R. Sengupta, "Geographical Routing using Partial Information for Wireless Ad Hoc Networks" IEEE Personal Communications, vol.8,
[26] B. Karp and H. T. Kung, "GPSR: Greedy Perimeter Stateless Routing for
. S. J. De Couto, D. R. Karger, and R. Morris, "A Scalable Location Service for Geographic Ad Hoc Routing", Proceedings of the ACM/IEEE
[28] R. Morris, J. Jannotti, F. Kaashoek, J. Li, and D. S. J. De Couto, "Carnet: A
[29] E. M. Royer and C. E. Perkins, ”Multicast Operation of the Ad-Hoc On-Demand 99, pp.
207-218.
s of the IEEE Military Communications Conference, vol.1, Oct. -Nov. 1999, pp. 25-29.
7, iss.6, Dec. 2002, pp.
429-439.
no.1, 2001, pp. 48-57.
Wireless Networks," Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, Aug. 2000, pp. 243-254
[27] J. Li, J. Jannotti, D
MobiCom, Aug. 2000, pp. 120-130.
Scalable Ad Hoc Wireless Network System," Proceedings of the 9th ACM SIGOPS European Workshop: Beyond the PC: New Challenges for the Operating System, Sep.
2000.
Distance Vector Routing Protocol,” Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking, Aug. 19
[30] C. W. Wu and Y. C. Tay, ”AMRIS: A Multicast Protocol for Ad Hoc Wireless Networks,” Proceeding
[31] J. Xie, R. R. Talpade, A. Mcauley, and M. Liu, ”AMRoute: Ad Hoc Multicast Routing Protocol,” Mobile Networks and Applications, vol.
[32] S. K. S. Gupta and P. K. Srimani, ”An Adaptive Protocol for Reliable Multicast in Mobile Multi-Hop Radio Networks,” Proceedings of the Second IEEE Workshop
E Wireless Communications and Networking Conference, vol.3, Sep. 1999, pp.
1298-1302.
1380-1394.
ations, vol.17, iss.8, Aug. 1999, pp. 1454-1465.
7] K. Viswanath, K. Obraczka, and G. Tsudik, “Exploring mesh and tree-based multicast. Routing protocols for MANETs,” the IEEE Mobile Computing Journal,
:comparing AODV and ODMRP,” Distributed Computing Systems, Proceedings of the 22nd
ww.isi.edu/nsnam/ns/ns-documentation.html
working, vol.2, no.5, Dec. 2002, pp. 483-502.
on Mobile Computing Systems and Applications, Feb. 1999, pp. 111-122.
[33] S. J. Lee, M. Gerla, and C. C. Chiang, ”On-Demand Multicast Routing Protocol,”
the IEE
[34] J. J. Garcia-Luna-Aceves and E. L. Madruga, ”The Core-Assisted Mesh Protocol,” the IEEE Journal on Selected Areas in Communications, vol.17, iss.8, Aug.
1999, pp.
[35] P. Sinha, R. Sivakumar, and V. Bharghavan, ”MCEDAR: Multicast Core-Extraction Distributed Ad Hoc Routing,” the IEEE Wireless Communications and Networking Conference, vol.3, Sep. 1999, pp. 1313-1317.
[36] P. Sinha, R. Sivakumar, and V. Bharghavan, ”CEDAR: a Core-Extraction Distributed Ad Hoc Routing Algorithm,” the IEEE Journal on Selected Areas in Communic
[3
vol.5, iss.1, Jan. 2006, pp. 28-42.
[38] T. Kunz and E. Cheng, ”On-demand multicasting in ad-hoc networks International Conference, Jul. 2002, pp. 453-454.
[39] http://w
[40] T. Camp, J. Boleng, and V. Davies, ”A Survey of Mobility Models for Ad Hoc Network Research,” Wireless Communications and Mobile Computing: Special Issue on Mobile Ad Hoc Net