HAR: Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks

Thepvilojanapong, Niwat; Tobe, Yoshito; Sezaki, Kaoru

doi:10.1109/saint.2005.34

Cited by 22 publications

(17 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, the intermediate nodes consume energy quickly. In the Hierarchy-Based Anycast Routing (HAR) Protocol for Wireless Sensor Networks [17], the sink constructs a hierarchical tree by sending packets (such as CREQ, CREP, CACP, PREQ) to discover each node's own child nodes in turn. HAR avoids both flooding and periodic updating of routing information, but needs to reconstruct the tree when nodes fail or new nodes are added.…”

Section: Related Methodsmentioning

confidence: 99%

Energy Efficient Hierarchy-based Clustering Routing Protocol for Wireless Sensor Networks

Neogi¹,

Bhaskar²,

Chakrabarti³

2014

IJCA

View full text Add to dashboard Cite

Wireless sensor network (WSN) consisting of a large number of sensor nodes is effective for gathering data in a variety of environments. Since the sensors operate on battery of limited power, it is a challenging task to design an efficient routing scheme which can minimize the delay while offering high energy efficiency and long network lifetime. Achieving both energy efficiency and scalability at the same time is a challenging task in wireless sensor networks. In this paper a new energy efficient hierarchy-based clustering routing protocol (EEHCR) is proposed for data gathering scheme for Wireless sensor networks. This is very crucial to ensure that the system operates at minimum energy with increasing scalability and network life-time. Simulation results show that the proposed routing scheme significantly reduces energy consumption and increases the lifetime of sensor network compared to other hierarchical routing protocols.

show abstract

Section: Related Methodsmentioning

confidence: 99%

Energy Efficient Hierarchy-based Clustering Routing Protocol for Wireless Sensor Networks

Neogi¹,

Bhaskar²,

Chakrabarti³

2014

IJCA

View full text Add to dashboard Cite

show abstract

“…It has been shown that the lifetime of a wireless sensor network can be increased by deploying several sinks, and accessing them using an anycast protocol [6,7]. In [8], the authors also showed that anycast forwarding schemes can significantly reduce the expected packet delivery delays.…”

Section: Anycast Communicationsmentioning

confidence: 99%

Routing Protocol for Anycast Communications in a Wireless Sensor Network

2010

View full text Add to dashboard Cite

International audienceIn wireless sensor networks, there is usually a sink which gathers data from the battery-powered sensor nodes. As sensor nodes around the sink consume their energy faster than the other nodes, several sinks have to be deployed to increase the network lifetime. In this paper, we motivate the need of anycast communications in wireless networks, where all the sinks are identical and can gather data from any source. To reduce interference and congestion areas on the wireless medium, the path from a source to a sink has to be distant from the path connecting another source to another sink. We show that determining distant paths from sources to sinks is an NP-hard problem, and we propose a linear formulation in order to obtain optimal solutions. Then, we propose a sink selection and routing protocol called S4 and based on realistic assumptions and we evaluate it through simulations. Finally, we conclude that anycast routing protocols in wireless sensor networks should not compute paths independently for each source, but rather consider all the sources simultaneously

show abstract

“…On one hand, we consider previous work on anycast in WSNs. For instance, in [15], authors propose an anycast routing protocols based on hierarchical tree. These works used a base station in order to build the routing tree.…”

Section: Related Workmentioning

confidence: 99%

SOLIST or How to Look for a Needle in a Haystack? A Lightweight Multi-overlay Structure for Wireless Sensor Networks

Busnel

Bertier

Kermarrec

2008

2008 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

View full text Add to dashboard Cite

Abstract-In this paper, we consider sensor database systems. Sensors are attached to objects and queries on the objects are operated at the sensor network level. Although queries to such a system might be extremely complex, ensuring efficiently basic functionalities such as broadcast or anycast without any central element is not trivial. In this paper, we provide a suite of *-cast (anycast, k-cast, broadcast) functionalities in a fully decentralized manner. More specifically, we present the design and evaluation of SOLIST, a multi-layer structure for sensors, largely inspired from structured peer-to-peer systems providing such functionalities. The main goal of SOLIST is to limit the overall energy consumption. A type is associated to each sensor, and the *-cast functionalities are implemented at a type granularity regardless of the number of types and their distribution within the network. A typical use of such a system is sensor-based stock management. We evaluate SOLIST through simulations and show that SOLIST achieves a reasonable tradeoff between performance and energy consumption.

show abstract

HAR: Hierarchy-Based Anycast Routing Protocol for Wireless Sensor Networks

Cited by 22 publications

References 26 publications

Energy Efficient Hierarchy-based Clustering Routing Protocol for Wireless Sensor Networks

Energy Efficient Hierarchy-based Clustering Routing Protocol for Wireless Sensor Networks

Routing Protocol for Anycast Communications in a Wireless Sensor Network

SOLIST or How to Look for a Needle in a Haystack? A Lightweight Multi-overlay Structure for Wireless Sensor Networks

Contact Info

Product

Resources

About