| 論文目次 |
Contents
1 Introduction 1
2 Preliminaries 5
2.1 System Model...........................................................5
2.2 Related Works..........................................................7
2.3 Motivation.............................................................10
3 Our QoS Routing Protocol 12
3.1 Data Strcture..........................................................13
3.2 Route Discovery Phase..................................................17
3.3 Bandwidth reservation phase............................................21
3.4 The Half-duplex and Full-duplex QoS Routes.............................23
3.5 Route Maintenance......................................................24
4 Simulation Results 26
4.1 Impact of Bandwidth Requirement........................................27
4.2 Impact of Traffic Load.................................................29
4.3 Impact of Host Density.................................................30
4.4 Impact of Mobility.....................................................31
5 Conclusions 34
List of Figures
2.1 (a)Hosts A and D can use time slot {s} simultaneously (b)the exposure terminal problem (c)the hidden termial problem................................7
2.2 The effective bandwidth of links ab and bc and path ac....................10
2.3 Reserve the proper time slot for links and ..................10
3.1 A simplified min-max example to choose the QoS route......................13
3.2 Tables TS and RS of hosts A, B, C, and D..................................15
3.3 An example of calculating the bottleneck of a path........................17
3.4 (a) Combines TS and RS tables of hosts C and D and get TSCD and RSCD. (b)Calculate the weights for reserving s1 and s2.................................23
4.1 Route establishment probability vs. bandwidth requirement (50 hosts, 15 sessions, 5000packets/session, moving speed = 5 m/sec)........................28
4.2 Packet loss rate vs. bandwidth requirement (50 hosts, 15 sessions, moving speed = 5 m/sec)..............................................................28
4.3 Route establishment probability vs. traffic load (50 hosts, 30 sessions, 5000 packets/session, moving speed = 5 m/sec).................................30
4.4 Packet loss rate vs. traffic load (50 hosts, 30 sessions, moving speed = 5 m/sec)........................................................................30
4.5 Route establishment probability vs. host density (25 hosts, 15 sessions, 5000 packets/session, moving speed = 5 m/sec).................................31
4.6 Packet loss rate vs. host density (25 hosts, 15 sessions, moving speed = 5 m/sec)........................................................................31
4.7 Route establishment probability vs. mobility (50 hosts, 15 sessions, 5000 packets/session, moving speed = 0 m/sec)......................................32
4.8 Route establishmetn probability vs. mobility (50 hosts, 15 sessions, 5000 packets/session, moving speed = 10 m/sec).....................................32
4.9 Packet loss rate vs. mobility (50 hosts, 15 sessions, moving speed = 0 m/sec)........................................................................33
4.10 Packet loss rate vs. mobility (50 hosts, 15 sessions, moving speed = 10 m/sec)........................................................................33
List of Tables
4.1 Route delay vs. bandwidth requirement (50 hosts, 15 sessions, 5000 packets/session, moving speed = 5 m/sec)......................................29
4.2 Control overhead vs. bandwidth requirement (50 hosts, 15 sessions, 5000 packets/session, moving speed = 5 m/sec) |
| 參考文獻 |
Bibliography
[1] E. M. Royer and C.-K. Toh, “A review of current routing protocols for ad hoc mobile
wireless networks,” IEEE Personal Communications, pp. 46–55, Apr. 1999.
[2] C. Perkins and E. M. Royer, “Ad hoc on demand distance vector routing,” Proceedings
of the IEEE Workshop on Mobile Computing Systems and Applications,
pp. 90–100, Feb. 1999.
[3] D. B. Johnson and D. A. Maltz, “Dynamic source routing in ad hoc wireless networks,”
Mobile Computing, T. Imielinski and H. Korth, Eds. Norwell, MA: Kluwer,
pp. 153–181, 1996.
[4] V. D. Park and M. S. Corson, “A highly adaptive distributed routing algorithm
for mobile wireless networks,” Proceedings of the Joint Conference of the IEEE
Computer and Communications Societies (INFOCOM), pp. 7–11, 1997.
[5] S. Chen and K. Nahrstedt, “Distributed quality-of-service in ad-hoc networks,”
IEEE Journal on Select Areas in Communications, pp. 1488–1505, Aug. 1999.
[6] G. V. S. Raju, G. Hernandez, and Q. Zou, “Quality of service routing in ad hoc
networks,” Proceedings of IEEE Wireless Communications and Networking Conference,
vol. 1, pp. 263–265, Sep. 2000.
[7] R. Sivakumar, P. Sinha, and V. Bharghavan, “Cedar: a core-extraction distributed ad
hoc routing algorithm,” IEEE Journal on Selected Areas in Communications, vol.
17, pp. 1454–1465, Aug. 1999.
[8] S. H. Shah and K. Nahrstedt, “Predictive location-based qos routing in mobile ad
hoc networks,” Proceedings of IEEE International Conference on Communications,
vol. 2, pp. 1022–1027, 2002.
[9] E. S. Elmallah, H. S. Hassanein, and H. M. AboElFotoh, “Supporting qos routing in
mobile ad hoc networks using probabilistic locality and load balancing,” Proceedings
of IEEE Global Telecommunications Conference, vol. 5, pp. 2901–2906, Nov.
2001.
[10] H. X. Sun and H. D. Hughes, ,” Proceedings of IEEE Wireless Communications and
Networking Conference, vol. 2, pp. 1191–1195, Mar. 2002.
[11] S.-T. Sheu, T.-F. Sheu, C.-C. Wu, and J.-Y. Luo, “Design and implementation of
a reservation-based mac protocol for voice/data over ieee 802.11 ad-hoc wireless
networks,” Proceedings of IEEE International Conference on Communications, vol.
6, pp. 1935–1939, Jun. 2001.
[12] W. H. Liao, Y. C. Tseng, and K. P. Shih, “A tdma-base bandwidth reservation protocol
for qos routing in a wireless mobile ad hoc network,” Proceedings of IEEE
International Conference on Communications, vol. 5, pp. 3186–3190, 2002.
[13] C. R. Lin, “On-demand qos routing in multihop mobile networks,” Proceedings of
the Joint Conference of the IEEE Computer and Communications Societies (INFOCOM),
vol. 3, pp. 1735–1744, 2001.
[14] C. R. Lin and J.-S. Liu, “Qos routing in ad hoc wireless networks,” IEEE Journal
on Selected Areas in Communications, vol. 17, pp. 1426–1438, Aug. 1999.
[15] P.-H. Chuang and H.-K. Wu; M.-K. Liao, “Dynamic qos allocation for multimedia
ad hoc wireless networks,” Proceedings of International Conference on Computer
Communications and Networks, pp. 480–485, Oct. 1999.
[16] C. Zhu and M. S. Corson, “Qos routing for mobile ad hoc networks,” Proceedings
of the Joint Conference of the IEEE Computer and Communications Societies
(INFOCOM), vol. 2, pp. 958–967, Jun. 2002.
[17] Y.-K. Hwang and P. Varshney, “An adaptive qos routing protocol with dispersity for
ad-hoc networks,” Proceedings of the 36th Annual Hawaii International Conference
on System Sciences, pp. 302–311, Jan. 2003.
[18] S. Chakrabarti and A. Mishra, “Qos issues in ad hoc wireless networks,” IEEE
Communications Magazine, pp. 142–148, Feb. 2001.
[19] A. Ebner, H. Rohling, M. Lott, and R. Halfmann, “Decentralized slot synchronization
in highly dynamic ad hoc networks,” Proceedings of the 5th International
Symposium on Wireless Personal Multimedia Communications, vol. 2, pp. 494–498,
Oct. 2002.
[20] J. E. Kleider and S. Gifford, “Synchronization for broadband ofdm mobile ad hoc
networking: simulation and implementation,” Proceedings of IEEE International
Conference on Acoustics, Speech, and Signal Processing, vol. 4, pp. 3756–3759,
May 2002.
[21] A. A. Bertossi and M. A. Bonuccelli, “Code assignment for hidden terminal interference
avoidance in multihop radio networks,” IEEE/ACM Transactions on Networks,
pp. 441–449, Aug. 1995.
[22] J. J. Garcia-Luna-Aceves and J. Raju, “Distributed assignment of codes for multihop
packet-radio networks,” Proceedings of IEEE Military Communications Conference,
pp. 450–454, Nov. 1997. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
facebook
plurk
twitter
funp
google
live
udn
HD
myshare
reddit
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi