| 摘要(英) |
IEEE 802.15.4 wireless personal area network (WPAN) standard is an advanced wireless communication technology, which is designed to provide short-distance communication services. Due to most of IEEE 802.15.4 nodes relying on battery to operate IEEE 802.15.4 was designed with fetures of ultra low power consumption, low computation power and low hardware cost. To save power resource, IEEE 802.15.4 adopts the blind random backoff contention mechanism, which turns off the transceiver of device when a device does not have data to transmit. However, such design leads the hidden node problem to become inevitable. Previous research has shown that nodes in a random network have 41% probability to incur hidden node situation with the other nodes. Moreover, the hidden node collision chain problem may further downgrade the network throughput, increase transmission delay, retransmit data, and therefore cause more energy loss.
Because the conventional two way handshaking mechanism (such as request-to-send/clear-to-send (RTS/CTS)) is not suitable for IEEE 802.15.4 network, this thesis proposes an efficient grouping strategy, which is performed during node joining, to completely avoid the hidden node problem. Members of a group are non-hidden nodes to each other. In the presupposition that the new joining node does not affect the existent groups, this thesis proves that the maximal number of groups in a network is 9. Based on the grouping result, the proposed scheme partitions the time frame into several subperiods, one for each group. The length of subframe for a group is proportional to its group size. Simulation results illustrate that the proposed scheme can not only avoid hidden node problem but also outperform the IEEE 802.15.4 standard and pervious grouping strategy schemes.
|
| 參考文獻 |
[1]IEEE 802 Working Group, “Standard for Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low Rate Wireless Personal Area Networks (LR-WPANs),” ANSI/IEEE 802.15.4, Sep. 2006
[2]F. A. Tobagi and L. Kleinrock, “Packet Switching in Radio Channels: Part II-The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone Solution,“ IEEE Transactions on Communications, vol. 23, no. 12, pp. 1417-1433, Dec. 1975.
[3]Y. C. Tseng, S. Y. Ni, and E. Y. Shih, “Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network,” IEEE Transactions on Computers, vol. 52, no. 5, pp. 545-557, May 2003.
[4]IEEE 802.11 Working Group, “Information Technology Telecommunications and Information Exchange between Systems-Local and Metropolitan Area Network-Specific Requirement. Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,” ANSI/IEEE Std. 802.11b-1999/Cor 1-2001-7, Mar. 2007.
[5]S.T. Sheu, Y.Y. Shih and Y.-C. Cheng,”Grouping Strategy for Solving Hidden Node Problem in IEEE 802.15.4 LR-WPAN,” in Proceedings of WICON, pp.26-32, Jul. 2005.
[6]Z. J. Haas and J. Deng, "Dual busy tone multiple access (DBTMA) - A multiple access control scheme for ad hoc networks," IEEE Transactions on Communications, vol. 50, pp. 975-985, 2002.
[7]P. Karn, "MACA - A New Channel Access Method for Packet Radio," in Proceedings of the ARRL/CRRL Amateur Radio 9th Computer Networking Conference, 1990.
[8]E. S. Jung and N. H. Vaidya, ”A power control MAC protocol for ad hoc networks,” in Proceedings of ACM MOBICOM, pp. 36-47, 2002
[9]Sheth and R. Han,”SHUSH: reactive transmit power control for wireless MAC protocols,” in Proceedings of WICON, pp. 18-25, 10-14 Jul. 2005.
[10]J. Zhu, X. Guo, L. L. Yang, and W. Steven, ”A single-channel solution for transmission power control in wireless ad hoc networks,” in Proceedings of ACM MOBIHOC, pp. 210-221, 2004
[11]S. Zhang and S.J. Yoo, “Fast Recovery from Hidden Node Collision for IEEE 802.15.4 LR-WPANs,” in Proceedings of CIT, 2007
[12]A. Koubâa, R. Severino, M. Alves, and E. Tovar, H-NAMe: Specifying, implementing and testing a hidden-node avoidance mechanism for wireless sensor networks, Tech, Rep. HURRAY-TR-071113, Nov. 2007.
[13]C.H. Kwon, R.J. Tek, K.H. Kim and S.H. Yoo, “Dynamic Group Allocation Scheme for avoiding Hidden Node Problem in IEEE 802.15.4,” in Proceedings of ISCIT, 2009
[14]J.H. Lee, J.K. Choi, and S.J. Yoo, “Group Node Contention Algorithm for Avoiding Continuous Collisions in LR-WPAN,” in Proceedings of CIT, 2009
[15]M.C. Golumbic,” Algorithm graph theory and perfect graphs.” New York: Academic, 1980
[16]M.R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitrou,“The complexity of coloring circular arcs and chords,” in Proceedings of SIAM J. Alg. Disc. Meth. 1(2):216–227, Jun. 1980.
[17]H.W. Tseng, A.C. Pang, J.H. C, and C.F. Kuo, “An Adaptive Contention Control Strategy for IEEE 802.15.4-Based Wireless Sensor Networks”, IEEE Transactions on Vehicular Technology, vol. 58 pp. 5164-5173, May 2009.
|
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit