Sciweavers

1966 search results - page 350 / 394
» Robust Routing in Wireless Ad Hoc Networks
Sort
View
CCCG
2010
13 years 9 months ago
3d local algorithm for dominating sets of unit disk graphs
A dominating set of a graph G = (V, E) is a subset V V of the nodes such that for all nodes v V , either v V or a neighbor u of v is in V . Several routing protocols in ad hoc ...
Alaa Eddien Abdallah, Thomas Fevens, Jaroslav Opat...
ESAS
2006
Springer
13 years 11 months ago
So Near and Yet So Far: Distance-Bounding Attacks in Wireless Networks
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
Jolyon Clulow, Gerhard P. Hancke, Markus G. Kuhn, ...
DIALM
2003
ACM
139views Algorithms» more  DIALM 2003»
14 years 29 days ago
dBBlue: low diameter and self-routing bluetooth scatternet
This paper addresses the problem of scatternet formation for singlehop Bluetooth based ad hoc networks, with minimal communication overhead. We adopt the well-known structure de B...
Wen-Zhan Song, Xiang-Yang Li, Yu Wang 0003, Weizha...
TMC
2010
190views more  TMC 2010»
13 years 6 months ago
SAMAC: A Cross-Layer Communication Protocol for Sensor Networks with Sectored Antennas
—Wireless sensor networks have been used to gather data and information in many diverse application settings. The capacity of such networks remains a fundamental obstacle toward ...
Emad Felemban, Serdar Vural, Robert Murawski, Eyle...
GLOBECOM
2006
IEEE
14 years 1 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...