Sciweavers

394 search results - page 71 / 79
» Fault-Tolerant Relay Node Placement in Wireless Sensor Netwo...
Sort
View
INFOCOM
2007
IEEE
14 years 2 months ago
Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks
—We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm ...
An Nguyen, Nikola Milosavljevic, Qing Fang, Jie Ga...
IPCCC
2005
IEEE
14 years 1 months ago
Dynamic localization control for mobile sensor networks
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
APSCC
2008
IEEE
14 years 2 months ago
Integration and Implementation of Secured IP Based Surveillance Networks
— This paper presents a method of integration and implementation of transmitting video and audio data from multiple Internet Protocol (IP) surveillance cameras in a wireless sens...
Charles C. Castello, Jeffrey Fan, Te-Shun Chou, Ho...
INFOCOM
2005
IEEE
14 years 1 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
AAIM
2009
Springer
98views Algorithms» more  AAIM 2009»
14 years 2 months ago
Latency Constrained Aggregation in Chain Networks Admits a PTAS
This paper studies the aggregation of messages in networks that consist of a chain of nodes, and each message is time-constrained such that it needs to be aggregated during a give...
Tim Nonner, Alexander Souza