Nonuniform Grid‐Based Coordinated Routing in Wireless Sensor Networks

Akl, Robert; Kadiyala, Priyanka; Haidar, Mohamad

doi:10.1155/2009/491349

Cited by 14 publications

(9 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The cluster should cover all the nodes within the coverage area, and it should be provisioned with energy efficiency, marginal communication cost, and a balanced load in the network. Clustering protocols, such as LEACH, HEED, PEGASIS, TEEN, and APTEEN, focused on energy efficiency but failed to address the coverage of all the nodes deployed in the network [ 10 , 13 , 14 , 15 , 16 ].…”

Section: Related Workmentioning

confidence: 99%

“…In recent years, several clustering approaches have been aimed at addressing the efficient energy consumption issues in WSNs [ 4 , 5 , 9 , 10 , 11 , 12 ]. In most of the existing works, including LEACH [ 9 ], HEED [ 10 ], PEGASIS [ 13 ], enhanced LEACH and GBCR [ 14 ], and SPIN [ 15 ], the CH is selected based on the highest residual energy and the CH to CH data transmission is based on the coverage range and energy level. The selection and data transmission between CHs are based only on the energy levels and it could increase the number of hops from a CH to the sink node.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Heuristic Angular Clustering Framework for Secured Statistical Data Aggregation in Sensor Networks

Krishnasamy¹,

Dhanaraj

Gopal

et al. 2020

Sensors

View full text Add to dashboard Cite

Clustering in wireless sensor networks plays a vital role in solving energy and scalability issues. Although multiple deployment structures and cluster shapes have been implemented, they sometimes fail to produce the expected outcomes owing to different geographical area shapes. This paper proposes a clustering algorithm with a complex deployment structure called radial-shaped clustering (RSC). The deployment structure is divided into multiple virtual concentric rings, and each ring is further divided into sectors called clusters. The node closest to the midpoint of each sector is selected as the cluster head. Each sector’s data are aggregated and forwarded to the sink node through angular inclination routing. We experimented and compared the proposed RSC performance against that of the existing fan-shaped clustering algorithm. Experimental results reveal that RSC outperforms the existing algorithm in scalability and network lifetime for large-scale sensor deployments.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Heuristic Angular Clustering Framework for Secured Statistical Data Aggregation in Sensor Networks

Krishnasamy¹,

Dhanaraj

Gopal

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…The process of electing cluster heads will be done iteratively until all cluster heads are elected in the region, which makes the election process costly. Akl et al [7] presented a non-uniform grid-based coordinated routing scheme in wireless sensor networks. The non-uniform grid-based routing was derived from the uniform grid-based coordinated protocol.…”

Section: Grid-based Routingmentioning

confidence: 99%

Multipath Grid-Based Enabled Geographic Routing for Wireless Sensor Networks

Arafeh

Day

Touzene

et al. 2014

WSN

View full text Add to dashboard Cite

This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region of deployment. The objective of the proposed scheme is to determine optimal or near-optimal (within a defined constant) multiple disjoint paths (multipath) from a source node to the sink, in order to enhance the reliability of the network. The determined multiple disjoint paths would be used by the source node in a round-robin way to balance the traffic across the disjoint paths, and to avoid discovered paths with cell holes. The proposed scheme limits the use of broadcasting to the process of gateway election within each cell, and the process of maintaining the table of neighbors of each gateway. Our simulation results show the effectiveness and scalability of our routing scheme with increased network size compared to on-demand routing protocols.

show abstract

“…Those techniques have the common objective of trying to extend the lifetime of the sensor network. The non-uniform grid-based coordinated routing design for wireless sensor network was proposed in Akl et al (2009) to save energy consumption and prolong the network lifetime. The proposed scheme extended the traditional uniform grid-based routing scheme by dynamically partition the network to achieve better energy utilization.…”

Section: Related Workmentioning

confidence: 99%