Distributed Landmark Election and Routing Protocol for Grid-Based Wireless Sensor Networks

Liang, Chiu-Kuo; Lin, Jian-Da

doi:10.1109/ispa.2010.65

Cited by 3 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…DLER [10] is based on the idea that the sink elects a set of landmarks in the network to route data from the sensing field to the sink. To elect the landmarks, three different transmission ranges are used to broadcast control packets.…”

Section: Related Workmentioning

confidence: 99%

An Energy Efficient Cluster Formation and Maintenance Scheme for Wireless Sensor Networks

Hosen¹,

Kim²,

Cho³

2012

Journal of information and communication convergence engineerin

View full text Add to dashboard Cite

The vast potential applications of wireless sensor networks (WSNs) have attracted extensive research efforts. Conventional networks support mostly point-to-point or point-to-multipoint data forwarding [1].On the other hand, WSNs are often deployed to sense, process, and disseminate information on targeted physical environments. Furthermore, sensor nodes are deployed in large numbers and high density, thus resulting in a potentially huge amount of sensory data, which is often impractical to transmit to the sink directly, particularly from the perspective of energy conservation. Also, the deployed sensors are capable of communicating with each other across short distances. Therefore, data aggregation is required with cluster formation to effectively gather the data from the widespread sensors, and a hierarchical structure is needed to forward the data to the sink in order to curtail the network load and hence reduce energy consumption [2,3].The traditional topology-based WSN routing protocols are quite susceptible to node mobility mainly due to the predetermination of an end-to-end route before data transmits.Owing to the frequent and constant changing of the network topology, it is actually difficult to maintain a deterministic route. Therefore, link failure discovery and recovery procedures also consume time and energy.The most critical requirements of WSNs are achieving the expected throughput as well as covering the entire network efficiently. According to some previous studies on WSNs, it is a challenging job to maintain the mobile sensors in network construction and data forwarding. The flooding/ multicasting technique is an efficient approach to broadcasting the control/data packets in an environment AbstractNowadays, wireless sensor networks (WSNs) comprise a tremendously growing infrastructure for monitoring the physical or environmental conditions of objects. WSNs pose challenges to mitigating energy dissipation by constructing a reliable and energy saving network. In this paper, we propose a novel network construction and routing method by defining three different duties for sensor nodes, that is, node gateways, cluster heads, and cluster members, and then by applying a hierarchical structure from the sink to the normal sensing nodes. This method provides an efficient rationale to support the maximum coverage, to recover missing data with node mobility, and to reduce overall energy dissipation. All this should lengthen the lifetime of the network significantly.

show abstract

Section: Related Workmentioning

confidence: 99%

An Energy Efficient Cluster Formation and Maintenance Scheme for Wireless Sensor Networks

Hosen¹,

Kim²,

Cho³

2012

Journal of information and communication convergence engineerin

View full text Add to dashboard Cite

show abstract

“…Several network models for WSN, such as DLER [1] , PEGASIS [2] , TEEN [3] , are proposed in terms of the static scenario of sensor nodes. In practice, however, the node mobility feature is strongly required in many application areas such as location tracking.…”

Section: ⅱ Related Workmentioning

confidence: 99%

An Energy Aware Network Construction and Routing Method for Wireless Sensor Network

Hosen¹,

Lee²,

Cho³

2012

Journal of the Institute of Electronics Engineers of Korea

View full text Add to dashboard Cite

In Wireless Sensor Networks (WSNs) where deployed sensors are not stationary, the most important demand of is to design a cost effective and reliable network. This paper proposes an energy aware network construction and routing scheme, which is based on the hierarchical approach to distribute the task in some sensors in order to prolong the network lifetime. It aims to make even the energy consumption on constitute nodes. With the node hierarchy, the sink initiates the construction by electing gateway nodes in the network and the elected gateway nodes participate to form logical clusters by electing a cluster head in each cluster. Then, the cluster heads aggregate data from the sensing sensors and transmit the data to the sink through the gateway. Our simulation result illustrates that the proposed scheme provides a basement to reduce the source of energy dissipation in network construction, and as well as in data routing. Here, the notable issue comes from dynamic topology along with node mobility in order to design a well-consolidate network for gathering information. The rest of the paper is organized as follows. We briefly discuss the related works in section Ⅱ. We explain ECR as details in section Ⅲ. Our simulation results are presented in section Ⅳ. Section V presents our conclusions. Keywords Ⅱ. Related WorksSeveral network models for WSN, such as DLER [1] , PEGASIS [2] , TEEN [3] , are proposed in terms of the static scenario of sensor nodes. In practice, however, the node mobility feature is strongly required in many application areas such as location tracking. In the dynamic topology, cluster based network modeling and hierarchical routing protocol are widely adopted as discussed below. landmarks and transmit it to at most X distance for all deployed sensors in the network. Each node maintains the HVC chart to get the auxiliary routing path to transmit data to the sink using the greedy forwarding method. With this method, the problem is that it leads to the large number of control packets and consumes more energy to construct a virtual coordinate system and to maintain the chart. RGR[6] is based on geographic and optimistic forwarding routing. The assumption behind this protocol, a node is aware about the location of itself as well as the neighbor's location, where location information can be exchanged using one-hop beacon or piggyback in the data packet's header. When a source wants to transmit a packet, it gets the location of the destination first and then attaches it to the packet header together with its own location.This protocol is not efficient in the energy dissipation because data or control packet overhead will be increased due to the location tracking information for the neighboring nodes in each transmission.EER [7] assumed that two CHs are required to support the mobility of nodes inside a cluster. Over the CHs, a GN is responsible to forward data to the sink and performed an additional task to find out the missing node from the CH. This approach leads to increase the number of de...

show abstract

“…According to the current key technologies, boundary detection algorithm can be divided into three categories: boundary detection algorithm based on geometry [3], boundary detection algorithm based on statistical [4], boundary detection algorithm based on topology [5]. Some of these algorithms [3][4][5] must know the location of the node which relies on GPS positioning devices.…”

Section: Introductionmentioning

confidence: 99%

A Power-Control-Based WSN Boundary Detection Algorithm for Agricultural Environment Mornitoring

Liu

Chen

et al. 2013

AMM

View full text Add to dashboard Cite

As the traditional boundary detection algorithms usually ignore the boundary width, this paper proposed a boundary detection algorithm based on power control to adjust the edge width. The algorithm did not need to establish the 2-neighbor graph which with higher time and space is complex. The algorithm detected boundary only by analyzing the connectivity of the rings, and did not require any information about node location. Simulation results show that the algorithm can detect the boundary nodes exactly.

show abstract

Distributed Landmark Election and Routing Protocol for Grid-Based Wireless Sensor Networks

Cited by 3 publications

References 11 publications

An Energy Efficient Cluster Formation and Maintenance Scheme for Wireless Sensor Networks

An Energy Efficient Cluster Formation and Maintenance Scheme for Wireless Sensor Networks

An Energy Aware Network Construction and Routing Method for Wireless Sensor Network

A Power-Control-Based WSN Boundary Detection Algorithm for Agricultural Environment Mornitoring

Contact Info

Product

Resources

About