Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks
スポンサーリンク
概要
- 論文の詳細を見る
In this letter, we propose three algorithms to reduce congestion for greedy forwarding, which is one of common principles in geographic routing. The new algorithms take geographic position information and network congestion metrics to balance traffic. When these algorithms are combined with well-known GPSR protocol [1], packet delivery ratio is enhanced by reducing number of lost packets in a buffer. In addition, end-to-end delay is reduced by bypassing congested nodes. These features are evaluated and analyzed through several simulation results.
- (社)電子情報通信学会の論文
- 2010-08-01
著者
-
Kim Ki-il
Department Of Computer Science Chungnam National University
-
Baek Min-jung
Department Of Informatics Research Institute Of Computer And Information Communication Gyeongsang Na
-
Kim Ki-il
Department Of Informatics Research Institute Of Computer And Information Communication Gyeongsang Na
-
Sung Tae‐eung
School Of Electrical And Computer Engineering Cornell University
-
SUNG Tae-Eung
School of Electrical and Computer Engineering, Cornell University
-
Sung Tae-eung
School Of Electrical And Computer Engineering Cornell University
関連論文
- IPv6 Multihoming Scheme Considering Load Sharing and Delay(Network)
- A Revised Routing Protocol Based on Associativity(Network)
- Establishing Multiple Paths for Multihoming on SCTP in MANET
- Load Balancing for Greedy Forwarding of Geographic Routing in Wireless Networks
- Network Layer Approaches for (m, k)-Firm Stream in Wireless Sensor Networks