Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Receiver-initiated busy-tone multiple access in packet radio networks
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
MACAW: a media access protocol for wireless LAN's
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Floor acquisition multiple access (FAMA) for packet-radio networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Distributed fair scheduling in a wireless LAN
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Ad hoc networking: an introduction
Ad hoc networking
Distributed multi-hop scheduling and medium access with delay and throughput constraints
Proceedings of the 7th annual international conference on Mobile computing and networking
A new approach to channel access scheduling for Ad Hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
SEEDEX: a MAC protocol for ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Characterizing the interaction between routing and MAC protocols in ad-hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Coordinated multihop scheduling: a framework for end-to-end services
IEEE/ACM Transactions on Networking (TON)
Time Synchronization for Wireless Sensor Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
A Distributed Scheduling Algorithm for Quality of Service Support in Multiaccess Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Hybrid routing in ad hoc networks with a dynamic virtual backbone
IEEE Transactions on Wireless Communications
Asynchronous transfer of video
IEEE Communications Magazine
Factor interaction on service delivery in mobile ad hoc networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper addresses the problem of optimizing the packet transmission schedule in an ad hoc network with end-to-end delay constraints. The emphasis is to determine the proper relative weights assigned to the remaining distance and the remaining lifetime in order to rank the urgency of a packet. We consider a general class of transmission schemes that represent such relative weights using a single lifetime-distance factor, which includes, as special cases, schedules such as Earliest-Deadline-First and Largest-Distance-First. We propose an analytical framework, based on recursive non-homogeneous Markovian analysis, to study the effect of the lifetime-distance factor on packet loss probability in a general multihop environment, with different configurations of peer-node channel contention. Numerical results are presented to demonstrate how various network parameters affect the optimal lifetime-distance factor. We demonstrate quantitatively how the proper balance between distance and lifetime in a transmission schedule can significantly improve the network performance, even under imperfect schedule implementation.