Record Details

Transmission scheduling for gossiping in multihop packet radio networks

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Transmission scheduling for gossiping in multihop packet radio networks
 
Creator PANCHAPAKESAN, PADMA
MANJUNATH, D
 
Subject deterministic algorithms
network topology
packet radio networks
randomised algorithms
scheduling
telecommunication network routing
 
Description Routing information updates, exchange of congestion control information, and synchronisation in distributed computation environments may require that some information from all the nodes be broadcast to all the nodes in the network. We consider such all-to-all broadcast, or gossiping as it is known in the literature, in multihop packet radio networks in an ad hoc network setup. Scheduling of transmissions in a packet radio network can be done either deterministically or randomly. The use of deterministic scheduling algorithms for ad hoc (multihop radio) networks whose topologies are dynamic may not be practical and transmission scheduling with randomised transmissions may be better suited in these networks. We study the performance of deterministic and randomised algorithms for scheduling for a class of communication requirements, called gossiping, in multihop radio networks.
 
Publisher IEEE
 
Date 2008-12-16T11:32:24Z
2011-11-28T09:17:08Z
2011-12-15T09:58:06Z
2008-12-16T11:32:24Z
2011-11-28T09:17:08Z
2011-12-15T09:58:06Z
2000
 
Type Article
 
Identifier Proceedings of the IEEE International Conference on Personal Wireless Communications, Hyderabad, India, 17-20 December 2000, 345-349.
0-7803-5893-7
10.1109/ICPWC.2000.905834
http://hdl.handle.net/10054/337
http://dspace.library.iitb.ac.in/xmlui/handle/10054/337
 
Language en