Localization for Wireless Sensor Networks: Protocols and Perspectives

Battelli, M.; Basagni, Stefano

doi:10.1109/ccece.2007.274

Cited by 19 publications

(5 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The data packet is sent to the selected relay. (6) Receive RTS: This is the state a node is in while participating to a contention as a volunteer relay. (7) Receive Data: The node has been selected as a relay.…”

Section: Protocol Analysismentioning

confidence: 99%

“…In case the WSN is a data retrieving network, the final destination is one of the available sinks. Although information about the node's position can be retrieved at reasonable cost , in many fixed networks, it is feasible to hardcode it in the nodes. Another advantage of geographic routing is that it itself does not create multihop overhead for route discovery and maintenance.…”

Section: Introduction and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A detailed analytical and simulation study of geographic random forwarding

Casari

Nati²,

Petrioli³

et al. 2011

Wireless Communications

View full text Add to dashboard Cite

In this paper, we extend previous work on geographic random forwarding (GeRaF) by considering a more efficient paradigm whereby on/off cycles are exploited and every node can participate to packet relaying, as long as it wakes up during any handshake procedure. The protocol is fully distributed, as routing decisions are made hop by hop based on geographic metrics and using a joint channel access/routing procedure, like in the first version of GeRaF. In addition, a previously defined analytical model for GeRaF is used to analyze the protocol, after extending it to cover the new channel access and relay selection procedure. The model is employed to find optimal choices for the parameters of the protocol, before comparing analytical results with ns2 simulations. Results confirm that the geographic paradigm remains a very good solution for energy-constrained, density-constrained, and latency-constrained networks, and that small yet very effective protocol optimizations can achieve remarkable performance improvements. Copyright (c) 2011 John Wiley & Sons, Ltd

show abstract

Section: Protocol Analysismentioning

confidence: 99%

Section: Introduction and Related Workmentioning

confidence: 99%

A detailed analytical and simulation study of geographic random forwarding

Casari

Nati²,

Petrioli³

et al. 2011

Wireless Communications

View full text Add to dashboard Cite

show abstract

“…However, sensors and sink need to be aware of their own position, 50 which can be obtained via GPS, or, when not possible, by executing a WSN localization algorithm. 11 Once routes are set up, and the sensors know the new position of the sink, the communication flow is from the sensors to the sink. Basagni et al 52 also describe a solution for a similar scenario with multiple sinks where the GMRE proactive location management is used for route management as described above.…”

Section: Gmre: the Greedy Maximum Residual Energy Protocol And Its Prmentioning

confidence: 99%

Location Management in Multi-Hop Wireless Sensor Networks

Basagni

Nanni

2010

Handbook on Sensor Networks

Self Cite

View full text Add to dashboard Cite

The chapter concerns solutions about the problems of managing the location information of nodes of ad hoc and wireless sensor networks (WSNs). Once nodes know about their location, solutions for location management take care of disseminating this important information to all or some of the other network nodes that need it for routing or other purposes. The chapter covers first the solutions that have been proposed for mobile ad hoc networks, where research in this area has started along geographic routing over a decade ago. We then describe solutions in the still largely uncharted territory of WSNs. In particular, we survey methods for location management that have been proposed for different application scenarios, emphasizing how location information is managed, i.e., proactively, reactively, or through dedicated nodes (location servers), which nodes move, and the different communication models adopted. Our review of the solutions currently proposed reveals that further research is needed for providing efficient location management protocols, especially for WSNs, and that the evaluation of their effectiveness for location aware applications and geographic routing is needed for truly identify new protocol design guidelines and improved network performance.

show abstract

“…Q-NiGHT (as GHT) requires that the nodes are aware of their geographical position. This can be easily provided using a GPS system or other localization strategies [7]. For some applications, e.g., intrusion detection or some environmental monitoring, this knowledge is essential to provide meaningful data to the end-user.…”

Section: Ght and Q-nightmentioning

confidence: 99%

Fault-Tolerant and Load Balancing Localization of Services in Wireless Sensor Networks

Nidito

Battelli

Basagni

2007

2007 IEEE 66th Vehicular Technology Conference

Self Cite

View full text Add to dashboard Cite

Heterogeneous wireless sensor networks are made up of different kinds of nodes. Some nodes, the sensors, are used as an interface to the physical environment. Other nodes act instead as servers, providing various services to the sensors. In this paper we define an architecture to enable the sensors to efficiently localize the services, and hence the servers. Our is a two-tier server architecture. The first tier is made up of the actual servers. The second tier is formed by nodes that are basically standard nodes (like the sensors). These nodes know the current position of the servers (they are called server locators). Sensors needing service query the server locators to find the corresponding service. The service locator sends a service position to the sensor. Finally, once got ahold of a server location, a sensor uses the service directly. Our server architecture provides load balancing (of queries to the servers) and is tolerant to server faults. Sensor nodes are endowed with caches to maintain the location of popular services. Experiments demonstrate the effectiveness of using caches at the sensor nodes.

show abstract

Localization for Wireless Sensor Networks: Protocols and Perspectives

Cited by 19 publications

References 27 publications

A detailed analytical and simulation study of geographic random forwarding

A detailed analytical and simulation study of geographic random forwarding

Location Management in Multi-Hop Wireless Sensor Networks

Fault-Tolerant and Load Balancing Localization of Services in Wireless Sensor Networks

Contact Info

Product

Resources

About