成功大學博碩士論文系統

簡易檢索 / 詳目顯示

回結果列表

研究生：	鍾欣宏 Chung, Shin-Hung
論文名稱：	在使用位址資訊的無線隨意網路中利用輔助節點提升資料傳輸成功率 Improving Data Transmission with Helping Nodes for Geographical Ad Hoc Routing
指導教授：	斯國峰 Ssu, Kuo-Feng
學位類別：	碩士 Master
系所名稱：	電機資訊學院 - 電腦與通信工程研究所 Institute of Computer & Communication Engineering
論文出版年：	2006
畢業學年度：	94
語文別：	英文
論文頁數：	34
中文關鍵詞：	隨意網路、行動計算、資料可得性、網路分割
外文關鍵詞：	information availability, mobile computing, ad hoc networks, network partitions
相關次數：	點閱：87 下載：3
分享至:	分享至facebook 分享至twitter

查詢本校圖書館目錄查詢臺灣博碩士論文知識加值系統勘誤回報

多數無線隨意網路的路由協定都假設節點分佈密度大到足以忽略網路不連通的情形，但事實上，由於節點可以任意移動，網路不連接的情況是很可能發生的。本篇論文提出一個在使用位址資訊且網路可能分割不連通的環境，找出合適的輔助節點幫忙將資料傳送到目的地。有別於其他利用特殊節點傳輸的模式，這個輔助節點是從一般的節點選出，並保有自由行動的權利。論文中也討論輔助節點在傳輸過程中可能發生的換手問題，並發展出應對的處理機制。此輔助傳輸機制已成功地實作於 NS2 網路模擬器。模擬結果可看出此演算法提升了整體資料傳輸成功率，在節點分佈比較稀疏的環境改善更為明顯。

Many routing protocols have been proposed in mobile ad hoc networks. Most protocols assume that node density of the networks is high enough so network partitions will not occur. As a matter of fact, it is illegitimate to have such hypothesis because node mobility and random deployment can easily make partitions happened. This thesis describes an approach to locating helping nodes for carrying data packets from one partition to another with geographic routing. Unlike assisting nodes in other schemes, the helping node chosen from a group of regular mobile nodes keeps moving based on its will. The approach also handles handoff when needed in the routing trip of the helping node. The mechanism has been implemented with the network simulator 2. The results demonstrate that the algorithm can improve the information availability especially in sparse networks.

Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1
Related Work : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3
1 Location Service . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 Network Partitioning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.1 Trajectory Modification . . . . . . . . . . . . . . . . . . . . . . . 6
2.2 Packets Carrier . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
System Model and Assumptions : : : : : : : : : : : : : : : : : : : : : : : 8
Algorithm for Helping Nodes Selection : : : : : : : : : : : : : : : : : : : 10
1 Registration . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2 Helping Node Selection . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
3 Helping Node Selection with Handoff . . . . . . . . . . . . . . . . . . . . 16
Performance Evaluation : : : : : : : : : : : : : : : : : : : : : : : : : : : : 20
1 Simulation Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
2 Performance Metrics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
3 Simulation Results . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.1 Helping Node Selection . . . . . . . . . . . . . . . . . . . . . . . . 23
3.2 Normal Environment . . . . . . . . . . . . . . . . . . . . . . . . . 24
3.3 Partitioned Environment . . . . . . . . . . . . . . . . . . . . . . . 25
Conclusion : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 30
References : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 31
Vita : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 34
                                    

[1] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-
Vector Routing (DSDV) for Mobile Computers,” Proceedings of the Conference on
Communications Architectures, Protocols and Applications, pp. 234–244, Oct. 1994.
[2] C.-C. Chiang, H.-K. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop,
Mobile Wireless Networks with Fading Channel,” Proceedings of the 5th IEEE Singapore
International Conference on Networks (SICON), pp. 197–211, Apr. 1997.
[3] D. B. Johnson and D. A. Maltz, “Dynamic Source Routing in Ad Hoc Wireless
Networks,” in Mobile Computing (Imielinski and Korth, eds.), vol. 353, pp. 153–181,
Kluwer Academic Publishers, 1996.
[4] C. E. Perkins and E. M. Royer, “Ad Hoc On-Demand Distance Vector Routing
Protocol,” Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems
and Applications (WMCSA), pp. 90–100, Feb. 1999.
[5] M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-based Routing in
Mobile Ad Hoc Networks,” IEEE Network Magazine, vol. 15, no. 6, pp. 30–39, Nov.
2001.
[6] A. Vahdat and D. Becker, “Epidemic Routing for Partially-connected Ad Hoc Networks,”
Tech. Rep. CS-200006, Duke University, Apr. 2000.
[7] Q. Li and D. Rus, “Sending Messages to Mobile Users in Disconnected Ad-Hoc Wireless
Networks,” Proceedings of the 6th Annual ACM/IEEE International Conference
on Mobile Computing and Networking (MobiCom), pp. 44–55, Aug. 2000.
[8] Q. Li and D. Rus, “Message Relay in Disconnected Ad-Hoc Networks,” Proceedings
of the International Workshop on Mobility and Wireless Access, pp. 14–21, Oct.
2002.
[9] R. Shah, N. C. Hutchinson, and W. S. Evans, “Voil`a: Delivering Messages Across
Partitioned Ad-Hoc Networks,” Proceedings of the 29th Annual IEEE International
Conference on Local Computer Networks (LCN), pp. 610–617, Nov. 2004.
[10] J. A. Davis, A. H. Fagg, and B. N. Levine, “Wearable Computers as Packet Transport
Mechanisms in Highly-partitioned Ad-Hoc Networks,” Proceedings of International
Symposium on Wearable Computers, pp. 141–148, Oct. 2001.
[11] C.-H. Ou, K.-F. Ssu, and H. C. Jiau, “Connecting Network Partitions with Location-
Assisted Forwarding Nodes in Mobile Ad Hoc Environments,” Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC),
pp. 239–247, Mar. 2004.
[12] W. Zhao and M. H. Ammar, “Message Ferring: Proactive Routing in Highlypartitioned
Wireless Ad Hoc Networks,” Proceedings of the 9th IEEE Workshop
on Future Trends of Distributed Computing Systems (FTDCS), pp. 308–314, May
2003.
[13] S. Basagni, I. Chlamtac, V. R. Syrotiuk, and B. A. Woodward, “A Distance
Routing Efficient Algorithm for Mobility (Dream),” Proceedings of the 4th Annual
ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom),
pp. 76–84, Oct. 1998.
[14] Z. J. Haas and B. Liang, “Ad Hoc Mobility Management with Uniform Quorum
Systems,” ACM/IEEE Transactions on Networking, vol. 7, no. 2, pp. 228–240, Apr.
1999.
[15] J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger and R. Morris, “A Scalable
Location Service for Geographic Ad Hoc Routing,” Proceedings of the 6th Annual
ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom),
pp. 120–130, Aug. 2000.
[16] R. Morris, J. Jannotti, F. Kaashoek, J. Li and D. S. J. De Couto, “CarNet: A
Scalable Ad Hoc Wireless Network System,” Proceedings of the 9th ACM SIGOPS
European Workshop: Beyond the PC: New Challenges for the Operating System,
Sept. 2000.
[17] S. Giordano and M. Hamdi, “Mobility Management: The Virtual Home Region,”
Tech. Rep. TR-99-037, Ecole Polytechnique Federale de Lausanne, Oct. 1999.
[18] I. Stojmenovic, “Home Agent Based Location Update and Destination Search
Schemes in Ad Hoc Wireless Networks,” Tech. Rep. TR-99-10, University of Ottawa,
Sept. 1999.
[19] S.-C. Woo and S. Singh, “Scalable Routing Protocol for Ad Hoc Networks,” ACM
Wireless Networks, vol. 7, no. 5, pp. 513–529, Sept. 2001.
[20] D. Goyal and J. Caffery, Jr., “Partitioning Avoidance in Mobile Ad Hoc Networks
Using Network Survivability Concepts,” Proceedings of International Symposium on
Computer and Communications (ISCC), pp. 553–558, July 2002.
[21] B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins, Global Positioning System:
Theory and Practice. Springer-Verlag, 1997.
[22] K. Sanzgiri, B. Dahill, B. Levine, and E. Belding-Royer, “A Secure Routing Protocol
for Ad Hoc Networks,” International Conference on Network Protocols, pp. 78–87,
Nov. 2002.
[23] S. Nesargi and R. Prakash, “MANETconf: Configuration of Hosts in a Mobile Ad
Hoc Network,” Proceedings of the 21th Annual Joint Conference of the IEEE Computer
and Communications Societies (INFOCOM), pp. 1059–1068, June 2002.[24] M. Mohsin and R. Prakash, “IP Address Assignment in Mobile Ad Hoc Networks,”
Proceedings of IEEE Military Communications Conference (MILCOM), Sept. 2002.
[25] M. Thoppian and R. Prakash, “A Distributed Protocol for Dynamic Address Assignment
in Mobile Ad Hoc Networks,” IEEE Transactions on Mobile Computing,
vol. 5, no. 1, pp. 4–19, Jan. 2006.
[26] T. N. S. ns 2. http://www.isi.edu/nsnam/ns/.
[27] The ns Manual. http://www.isi.edu/nsnam/ns/doc/index.html.
[28] J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. G. Jetcheva, “A Performance
Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proceedings
of the 4th Annual ACM/IEEE International Conference on Mobile Computing and
Networking (MobiCom), pp. 85–97, Oct. 1998.

校內：2008-07-25公開
校外：2008-07-25公開

簡易檢索 / 詳目顯示

相關論文