Sciweavers

1373 search results - page 268 / 275
» Self-securing ad hoc wireless networks
Sort
View
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 1 months ago
Tuning Up the Performance of Constant-Time Distributed Scheduling Algorithms via Majorization
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Han Cai, Do Young Eun
CAISE
2003
Springer
14 years 21 days ago
Sharing Mobile Databases in Dynamically Configurable Environments
We define a Mobile Database Community (MDBC) as a dynamic collection of autonomous mobile databases in which each database user can access databases in the community through a wir...
Angelo Brayner, José de Aguiar Moraes Filho
TMC
2010
158views more  TMC 2010»
13 years 5 months ago
Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
Murtuza Jadliwala, Sheng Zhong, Shambhu J. Upadhya...
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 2 months ago
Fairness issues in a chain of IEEE 802.11 stations
: We study a simple general scenario of ad hoc networks based on IEEE 802.11 wireless communications, consisting in a chain of transmitters, each of them being in the carrier sense...
Bertrand Ducourthial, Yacine Khaled, Stépha...
MOBIHOC
2006
ACM
14 years 7 months ago
Performance analysis of mobility-assisted routing
Traditionally, ad hoc networks have been viewed as a connected graph over which end-to-end routing paths had to be established. Mobility was considered a necessary evil that inval...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...