Efficient Packet Routing in Highly Mobile Wireless Networks
详细信息 查看全文
- 作者：Cheoleun Moon ; Yusung Kim ; Dohyung Kim ; Hyunsoo Yoon…
- 关键词：Routing ; Opportunistic networks ; Wireless multi ; hop networks
- 刊名：Wireless Personal Communications
- 出版年：2015
- 出版时间：September 2015
- 年：2015
- 卷：84
- 期：2
- 页码：1265-1284
- 全文大小：1,450 KB
- 参考文献：1.Fall, K. (2003). A delay-tolerant network architecture for challenged internets. In Proceedings of the ACM SIGCOMM.
2.Johnson, D., & Maltz, D. (1996). Dynamic source routing in ad-hoc wireless networks. In Proceedings of the ACM SIGCOMM.
3.Perkins, C. E., & Bhagwat, P. (1994). Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Proceedings of the conference on communications architecture, protocols and applications (SIGCOMM 94).
4.Perkins, C. E., & Royer, E. M. (1999). Ad-hoc on-demand distance vector routing. In Proceedings of the IEEE workshop on mobile computing systems and applications (WMCSA), pp. 90鈥?00.
5.Marina, M. K., & Das, S. R. (2001). On-demand multipath distance vector routing in ad hoc networks. In Proceedings of the international conference for network protocols.
6.Ye, Z., Krishnamurthy, S. V., & Tripathi, S. K. (2003). A framework for reliable routing in mobile ad hoc networks. In Proceedings of the IEEE INFOCOM.
7.Biswas, S., & Morris, R. (2005) ExOR: Opportunistic multi-hop routing for wireless networks. In Proceedings of the ACM SIGCOMM.
8.Chachulski, S., Jennings, M., Katti, S., & Katabi, D. (2007). Trading structure for randomness in wireless opportunistic routing. In Proceedings of the ACM SIGCOMM.
9.Lin, Y., Le, B., & Liang, B. (2008). CodeOR: Opportunistic routing in wireless mesh networks with segmented network coding. In Proceedings of the IEEE international conference on network protocols.
10.Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc network, Technical report, Duke University, CS-200006.
11.Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In Proceedings of the ACM WDTN.
12.Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proceedings of the IEEE INFOCOM.
13.Balasubramanian, A., Levine, B. N., & Venkataramani, A. (2007). DTN routing as a resource allocation problem. In Proceedings of the ACM SIGCOMM.
14.Lindgren, A., Doria, A., & Scheln, O. (2004). Probabilistic routing in intermittently connected networks. In Proceedings of the SAPIR Workshop.
15.Small, T., & Haas, Z. (2005). Resource and performance tradeoffs in delay-tolerant wireless networks. In Proceedings of the ACM WDTN.
16.Burns, B., Brock, O., & Levine, B. N. (2005). MV routing and capacity building in disruption tolerant networks. In Proceedings of the IEEE INFOCOM.
17.Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proceedings of the ACM SIGCOMM.
18.Jones, E., Li, L., & Ward, P. (2005). Practical routing in delay-tolerant networks. In Proceedings of the ACM Chants Workshop.
19.Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In Proceedings of the IEEE SECON.
20.Musolesi, M., Hailes, S., & Mascolo, C. (2005). Adaptive routing for intermittently connected mobile ad hoc networks. In Proceedings of the IEEE WoWMoM.
21.Kretschmer, C., R眉hrup, S., & Schinderlhauer, C. (2009). DT-DYMO: Delay-tolerant dynamic MANET on-demand routing. In Proceedings of the IEEE ICDCS Workshops.
22.Chakeres, I., & Perkins, C. (2008). Dynamic MANET on-demand (DYMO) routing. IETF Internet Draft, draft-ietf-manet-dymo-14.
23.Whitbeck, J., & Conan, V. (2009). HYMAD: Hybrid DTN-MANET routing for dense and highly dynamic wireless networks. In Proceedings of the IEEE WoWMoM.
24.The Network Simulator-ns-2, http://鈥媤ww.鈥媔si.鈥媏du/鈥媙snam/鈥媙s/鈥?/span>
25.IEEE 802.11, Wireless LAN Medium Access Control(MAC) and Physical Layer(PHY) specifications, Standard, IEEE, August 1999.
26.Broch, J., Maltz, D., Johnson, D., Hu, Y.-C., & Jetcheva, J. (1998). A performance comparision of multi-hop wireless ad hoc network routing protocols. In Proceedings of the IEEE/ACM MOBICOM, pp. 85鈥?7.
27.Jun, T., Dalton, A., & Bodas, S. (2008). Expressive analytical model for routing protocols in mobile ad hoc networks. In proceedings of the IEEE International Conference on Communications.
28.Groenevelt, R., Nain, P., & Koole, G. (2005). The message delay in mobile ad hoc networks. Performance.
29.Zhang, E., Neglia, G., Kurose, J., & Towsley, D. (2007). Performance modeling of epidemic routing. Computer Networks, 51(10).
30.Lee, K., Yi, Y., Jeong, J., Won, H., Rhee, I., & Chong, S. (2010) Max-contribution: on optimal resource allocation in delay tolerant networks. In Proceedings of the IEEE INFOCOM.
31.Yu, D., Li, H,, & Gruber, I. (2003). Path availability in ad hoc network. In Proceedings of the International Conference on Telecommunications.
32.Bettstetter, C. (2004). On the connectivity of ad hoc networks. The Computer Journal.
33.Meisel, M., Pappas, V., & Zhang, L. (2010). Listen first, broadcast later: Topology-agnostic forwarding under high dynamics, Technical Report 100021, UCLA Computer Science Department.
34.S. J. U. Traffic Information Grid Team, Grid Computing Center, Shanghai taxi trace data, http://鈥媤irelesslab.鈥媠jtu.鈥媏du.鈥媍n/鈥?/span> - 作者单位：Cheoleun Moon (1)
Yusung Kim (2)
Dohyung Kim (2)
Hyunsoo Yoon (1)
Ikjun Yeom (2)
1. Department of Computer Science, KAIST, Daejeon, Republic of Korea
2. Department of Computer Engineering, Sungkyunkwan University, Suwon, Republic of Korea - 刊物类别：Engineering
- 刊物主题：Electronic and Computer Engineering
Signal,Image and Speech Processing
Processor Architectures - 出版者：Springer Netherlands
- ISSN：1572-834X
文摘
Traditional mobile ad-hoc network (MANET) and delay tolerant network (DTN) routing schemes work properly only under the limited assumptions. MANET routing schemes are designed for densely populated networks while DTN routing schemes were developed for dealing with intermittently connected topologies. However, in a real environment, the assumption cannot be hold: the density of nodes constantly changes and a network can be separated due to node mobility even when it is composed of large number of nodes. We propose a routing scheme for maximizing the delivery rate in a network with varying density. In the proposed scheme, data packets are used to search an available path while they are delivered by DTN-based routing. If a path exists, subsequent packets are relayed along the path. Otherwise, packets are delivered continuously using DTN-based routing. Using simulation we show that the proposed scheme achieves high throughput and a low overhead in a dense part of the network, while it outperforms existing DTN routing schemes in an intermittently connected situation.