Sciweavers

483 search results - page 65 / 97
» On extracting consistent graphs in wireless sensor networks
Sort
View
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 12 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
DIALM
2008
ACM
140views Algorithms» more  DIALM 2008»
15 years 1 months ago
Latency of opportunistic forwarding in finite regular wireless networks
In opportunistic forwarding, a node randomly relays packets to one of its neighbors based on local information, without the knowledge of global topology. Each intermediate node co...
Prithwish Basu, Chi-Kin Chau
MINENET
2006
ACM
15 years 5 months ago
How to extract BGP peering information from the internet routing registry
We describe an on-line service, and its underlying methodology, designed to extract BGP peerings from the Internet Routing Registry. Both the method and the service are based on: ...
Giuseppe Di Battista, Tiziana Refice, Massimo Rimo...
CIS
2009
Springer
15 years 6 months ago
BARI: A Distributed Key Management Approach for Wireless Body Area Networks
—In recent years, use of sensors to measure the biometrics and movements of human body have resulted in the design of wireless body area networks (WBAN). Although WBANs consist o...
Syed Muhammad Khaliq-ur-rehman Raazi, Heejo Lee, S...
TWC
2010
14 years 6 months ago
Distributed Routing Algorithms for Underwater Acoustic Sensor Networks
Underwater Acoustic Sensor Networks (UW-ASNs) consist of devices with sensing, processing, and communication capabilities that are deployed underwater to perform collaborative moni...
Dario Pompili, Tommaso Melodia, Ian F. Akyildiz