Title
A heuristic algorithm for optimum transmission schedule in broadcast packet radio networks
Abstract
Packet Radio networks are to provide data communications among a set of nodes distributed over a wide region. Transmission from nodes is broadcast in nature. Where direct communication between two nodes is not possible, connection is established in multiple hops. A time division multiple access (TDMA) protocol is adopted for conflict free communication among different nodes. The goal is to find a conflict free transmission schedule for different nodes at different time-slots of a fixed length time frame, called TDMA cycle. The optimization criterion is primarily to (1) minimize the TDMA cycle length, and then to (2) maximize the number of transmissions. The problem is proved to be NP-complete. A randomized algorithm is proposed, which is very efficient to achieve the first optimization criterion. The results are shown to be superior compared to other recently reported competitive algorithms.
Year
DOI
Venue
2005
10.1016/j.comcom.2004.06.009
Computer Communications
Keywords
Field
DocType
Packet radio network,Time division multiple access,Optimum transmission schedule
Broadcasting,Randomized algorithm,Time frame,Packet radio networks,Computer science,Heuristic (computer science),Scheduling (computing),Computer network,Real-time computing,Time division multiple access,Transmission schedule
Journal
Volume
Issue
ISSN
28
1
Computer Communications
Citations 
PageRank 
References 
2
0.37
17
Authors
3
Name
Order
Citations
PageRank
Goutam Chakraborty136356.31
Debasish Chakraborty27711.66
Norio Shiratori3818137.59