Sciweavers

415 search results - page 61 / 83
» Reactive routing overhead in networks with unreliable nodes
Sort
View
ICITA
2005
IEEE
14 years 2 months ago
QoS Functions and Theorems for Moving Wireless Networks
Optimum theorems for combining QoS metrics to reduce computation time in nodes (routers) is proposed based on fundamental theorems on QoS metrics. The proposed theorems unify sele...
Johnson I. Agbinya
MSWIM
2004
ACM
14 years 2 months ago
Consistency challenges of service discovery in mobile ad hoc networks
Emerging “urban” ad hoc networks resulting from a large number of individual WLAN users challenge the way users could explore and interact with their physical surroundings. Ro...
Christian Frank, Holger Karl
IPSN
2007
Springer
14 years 2 months ago
Wireless localization using self-organizing maps
Localization is an essential service for many wireless sensor network applications. While several localization schemes rely on anchor nodes and range measurements to achieve fine...
Gianni Giorgetti, Sandeep K. S. Gupta, Gianfranco ...
MOBIHOC
2002
ACM
14 years 8 months ago
Weak duplicate address detection in mobile ad hoc networks
Auto-configuration is a desirable goal in implementing mobile ad hoc networks. Specifically, automated dynamic assignment (without manual intervention) of IP addresses is desirabl...
Nitin H. Vaidya
COMCOM
2008
99views more  COMCOM 2008»
13 years 8 months ago
Efficiently reconfigurable backbones for wireless sensor networks
We present the definition and performance evaluation of a protocol for building and maintaining a connected backbone among the nodes of a wireless sensor networks (WSN). Building ...
Stefano Basagni, Chiara Petrioli, Roberto Petrocci...