Scheduling forwarding nodes for two-hop neighborhoods broadcast in wireless ad hoc networks

Authors:
Chenguang Xu;Minhong Lin;Yinlong Xu
Affiliations:
Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei, Anhui, P. R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei, Anhui, P. R. China;Department of Computer Science and Technology, University of Science and Technology of China, National High Performance Computing Center at Hefei, Hefei, Anhui, P. R. China
Venue:
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
Year:
2006

Citing 7
Cited 0

Unit disk graphs

Discrete Mathematics - Topics on domination
Almost optimal set covers in finite VC-dimension: (preliminary version)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
The broadcast storm problem in a mobile ad hoc network

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Selecting forwarding neighbors in wireless Ad Hoc networks

DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Asynchronous Multimedia Multihop Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Energy Efficient Broadcast Routing in Static Ad Hoc Wireless Networks

IEEE Transactions on Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims at scheduling the forwarding nodes in one-hop neighborhoods and making the two hop neighbors receive the message as soon as possible, which is modeled as the Minimum Time-Slot Forwarding (MTSF) problem. We prove that MTSF is NP-hard in general graph and propose two approximation algorithms. Theoretical analysis and simulation results show that the average time slot needed for broadcasting is a linear of ln|P|, where P is the set of two hop neighbors of source node s. We also compare the performance with that of flooding, and the simulation results show that both of them perform better than flooding.