First-fit scheduling for beaconing in multihop wireless networks

Authors:
Peng-Jun Wan;Zhu Wang;Hongwei Du;Scott C.-H. Huang;Zhiyuan Wan
Affiliations:
Department of Computer Science, Illinois Institute of Technology;Department of Computer Science, Illinois Institute of Technology;Department of Computer Science, Illinois Institute of Technology;Department of Computer Science, City University of Hong Kong;Department of Computer Science, City University of Hong Kong
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 6
Cited 1

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)
A new model for scheduling packet radio networks

Wireless Networks
Smallest-last ordering and clustering and graph coloring algorithms

Journal of the ACM (JACM)
Approximation algorithms for conflict-free channel assignment in wireless ad hoc networks: Research Articles

Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
The capacity of wireless networks

IEEE Transactions on Information Theory

Link scheduling in wireless networks with successive interference cancellation

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed in synchronous time-slots and each node can transmit at most one fixed-size packet in each time-slot. The problem Minimum-latency beaconing schedule (MLBS) in multihop wireless networks seeks a shortest schedule for beaconing subject to the interference constraint. MLBS has been intensively studied since the mid-1980s, but all assume the protocol interference model with uniform interference radii. In this paper, we first present a constant-approximation algorithm for MLBS under the protocol interference model with arbitrary interference radii. Then, we develop a constant-approximation algorithm for MLBS under the physical interference model. Both approximation algorithms have efficient implementations in a greedy first-fit manner.