Employing a Novel Two Tiered Network Structure to Extend the Lifetime of WSNs

Ha, Minh Thiep; Le, Trong Duc; Choo, Hyunseung

doi:10.1109/wcnc.2009.4917705

Cited by 8 publications

(3 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, sensors near to the sink diminish their energy sooner, causing formation of coronas. This snag is addressed effectively in [12], [14]. These dead nodes cause ailment in the network and reduces the sensing reportage of the network.…”

Section: Introductionmentioning

confidence: 99%

Estimation of Optimum Rendezvous Point for Mobile Sink (ORP-MS) in WSN

Vimal¹,

Nigam²

2018

IJET

View full text Add to dashboard Cite

Clustering of the sensors in wireless sensor network is done to achieve energy efficiency. The nodes, which are unable to join any cluster, are referred to as isolated nodes and tend to transfer information straight to the base station. It is palpable that isolated nodes and cluster heads communicate with the base station and tend to exhaust their energy leaving behind coverage holes. In this paper, we propose the innovative clustering scheme using mobile sink approach to extend networks lifetime. The proposed (ORP-MS) algorithm is implemented in MATLAB 2017a and the results revealed that the proposed algorithm outdid the existing algorithms in terms networks lifetime and energy efficiency simultaneously achieved high throughput.

show abstract

Section: Introductionmentioning

confidence: 99%

Estimation of Optimum Rendezvous Point for Mobile Sink (ORP-MS) in WSN

Vimal¹,

Nigam²

2018

IJET

View full text Add to dashboard Cite

show abstract

“…Wireless sensor networks (WSN) are composed of a large number of sensor nodes and in general, they are deployed in inaccessible and hostile environments, e.g., dense jungles, battlefields, and inside phenomenon [1], [8], [9], [19]. Sensor nodes are often powered by batteries that may not be recharged.…”

Section: Introductionmentioning

confidence: 99%

An Energy-efficient Multi-candidate Greedy Routing Scheme in Wireless Sensor Networks

Nguyen¹,

Choi²,

Ha³

et al. 2011

JNW

Self Cite

View full text Add to dashboard Cite

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently-connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. In this paper, we propose a novel emph{multi-candidate greedy routing} (MGR) scheme that makes the best effort to find minimum latency routes in the sensor networks. In MGR, each source node sends an RREQ to a set of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. Moreover, to cope with the unreliability of wireless links, we introduce an add-on algorithm for MGR, called emph{multilevel of link quality requirement-based packet forwarding} (MLRPF), which helps to increase the energy efficiency of MGR while still guaranteeing a low delivery latency. Simulation results demonstrate that MLRPF increases the routing performance of MGR significantly compared with PRRxDistance cite{7}, DGF cite{3}, and ODML cite{2} in terms of packet delivery latency and energy efficiency

show abstract

“…Wireless sensor networks (WSNs) are composed of a large number of sensor nodes and in general, they are deployed in inaccessible and hostile environments, e.g., dense jungles, battlefields, and inside phenomenon [1,11,5,6]. Sensor nodes are often powered by batteries that may not be recharged.…”

Section: Introductionmentioning

confidence: 99%

MGR

Nguyen

Choi

et al. 2010

Proceedings of the 4th International Conference on Uniquitous Information Management and Communication

Self Cite

View full text Add to dashboard Cite

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently connected. In light of this, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. Recently, Lu Su et al. have proposed an ODML routing scheme that finds low latency routes in intermittently-connected sensor networks by using RREQ and RREP messages [9]. Nevertheless, ODML does not consider the latency of RREP and has a high routing overhead. This paper proposes a novel Multicandidate Greedy Routing (MGR) scheme that makes the best effort to find minimum latency routes in wireless sensor networks. In MGR, each source node sends an RREQ to a set of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. Simulation results demonstrate that our proposed scheme performs better than the distance-based greedy forwarding and ODML in terms of delivery latency and routing overhead.

show abstract

Employing a Novel Two Tiered Network Structure to Extend the Lifetime of WSNs

Cited by 8 publications

References 18 publications

Estimation of Optimum Rendezvous Point for Mobile Sink (ORP-MS) in WSN

Estimation of Optimum Rendezvous Point for Mobile Sink (ORP-MS) in WSN

An Energy-efficient Multi-candidate Greedy Routing Scheme in Wireless Sensor Networks

MGR

Contact Info

Product

Resources

About