DocumentCode :
2982470
Title :
On local approximation of minimum-latency broadcast scheduling in 3D MANETs
Author :
Shen, Yilin ; Xuan, Ying ; Thai, My T.
Author_Institution :
CISE Dept., Univ. of Florida, Gainesville, FL, USA
fYear :
2011
fDate :
7-10 Nov. 2011
Firstpage :
866
Lastpage :
871
Abstract :
Minimum-latency broadcast scheduling problem has been a long-studied problem on the basis of conflict avoidance. However, no algorithms with theoretical performance guarantees have been proposed for this problem in 3D mobile ad hoc networks (MANETs), due to the significant hardness brought by various node mobilities in 3D space. As the first attempt in the literature to study this problem in 3D MANETs, we provide a localized approximation algorithm (LBS) with both theoretical and experimental guarantees with respect to time latency and message complexity.
Keywords :
approximation theory; communication complexity; mobile ad hoc networks; scheduling; 3D MANET; 3D mobile ad hoc networks; 3D space; LBS; localized approximation algorithm; message complexity; minimum-latency broadcast scheduling; Ad hoc networks; Approximation methods; Color; Connectors; Mobile computing; Schedules; Three dimensional displays;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
MILITARY COMMUNICATIONS CONFERENCE, 2011 - MILCOM 2011
Conference_Location :
Baltimore, MD
ISSN :
2155-7578
Print_ISBN :
978-1-4673-0079-7
Type :
conf
DOI :
10.1109/MILCOM.2011.6127787
Filename :
6127787
Link To Document :
بازگشت