Slot allocation strategies for TDMA protocols in multihop packet radio networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Making transmission schedules immune to topology changes in multi-hop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A mobility-transparent deterministic broadcast mechanism for ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Access Protocol for Broadband Multimedia Centralized Wireless Local Area Networks
ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Distributed resource allocation for DS-CDMA-based multimedia ad hoc wireless LANs
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
An ad-hoc network is a collection of wireless mobile nodes without the required intervention of any centralized Access Point. With the existence of the hidden terminals and the absence of the central control, the resource allocation is always a very challenging problem in such networks. In this paper, a distributed resource allocation scheme is designed for ad hoc networks, in which each mobile node dynamically searches its Native Index (NI) with negligible communication overhead. By utilizing the NI, the hidden terminal problem can be completely avoided in the resource allocation, and the resource can be efficiently distributed to all the nodes. The proposed resource allocation method can greatly improve the system throughput. Utilizing the method, the broadcast problem can be easily solved and QoS service (Quality of Service) can be efficiently supported.