Distributed Assignment Algorithms for Multihop Packet Radio Networks
IEEE Transactions on Computers
Data networks (2nd ed.)
Scheduling algorithms for multihop radio networks
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)
Floor acquisition multiple access (FAMA) for packet-radio networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Time-spread multiple-access (TSMA) protocols for multihop mobile radio networks
IEEE/ACM Transactions on Networking (TON)
An optimal topology-transparent scheduling method in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Unified Framework and Algorithm for (T/F/C)DMA Channel Assignment in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Channel access scheduling in Ad Hoc networks with unidirectional links
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
An Adaptive Location-Aware MAC Protocol for Multichannel Multihop Ad-Hoc Networks
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Distributed dynamic channel access scheduling for ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
Multiple Access Protocol for Power-Controlled Wireless Access Nets
IEEE Transactions on Mobile Computing
DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
A distributed load-based transmission scheduling protocol for wireless ad hoc networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
IEEE Transactions on Mobile Computing
Adaptive energy-efficient registration and online scheduling for asymmetric wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A wireless sensor networks MAC protocol for real-time applications
Personal and Ubiquitous Computing - Special Issue: Selected Papers of the ARCS06 Conference
Distributed scheduling algorithms for channel access in TDMA wireless mesh networks
The Journal of Supercomputing
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Access scheduling on the control channels in TDMA wireless mesh networks
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Access scheduling on the control channels in TDMA wireless mesh networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
FD-MAC: a flow-driven MAC protocol for mobile ad hoc networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A position based media access control protocol in large scale mobile ad hoc networks
TELE-INFO'10 Proceedings of the 9th WSEAS international conference on Telecommunications and informatics
Cross-layer transmission scheduling for direct-sequence spread-spectrum ad hoc networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
MH-TRACE: multi-hop time reservation using adaptive control for energy efficiency
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Operation of a dynamic transmission-scheduling protocol for mobile ad hoc networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
A real-time MAC protocol for wireless sensor networks: virtual TDMA for sensors (VTS)
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
NEW2AN'06 Proceedings of the 6th international conference on Next Generation Teletraffic and Wired/Wireless Advanced Networking
Distributed time slot assignment in wireless ad hoc networks for STDMA
ICDCIT'05 Proceedings of the Second international conference on Distributed Computing and Internet Technology
RFID reader collision problem: performance analysis and medium access
Wireless Communications & Mobile Computing
Many-to-one communication protocol for wireless sensor networks
International Journal of Sensor Networks
Distributed scheduling algorithms for channel access in TDMA wireless mesh networks
The Journal of Supercomputing
| Hi-index | 0.00 |
A new single channel, time division multiple access (TDMA)-based broadcast scheduling protocol, termed the Five-Phase Reservation Protocol (FPRP), is presented for mobile ad hoc networks. The protocol jointly and simultaneously performs the tasks of channel access and node broadcast scheduling. The protocol allows nodes to make reservations within TDMA broadcast schedules. It employs a contention-based mechanism with which nodes compete with each other to acquire TDMA slots. The FPRP is free of the "hidden terminal" problem, and is designed such that reservations can be made quickly and efficiently with negligible probability of conflict. It is fully-distributed and parallel (a reservation is made through a localized conversation between nodes in a 2-hop neighborhood), and is thus scalable. A "multihop ALOHA" policy is developed to support the FPRP. This policy uses a multihop, pseudo-Bayesian algorithm to calculate contention probabilities and enable faster convergence of the reservation procedure. The performance of the protocol, measured in terms of scheduling quality, scheduling overhead and robustness in the presence of nodal mobility, has been studied via simulations. The results showed that the protocol works very well in all three aspects. Some future work and applications are also discussed.