2017
DOI: 10.1155/2017/7507625
|View full text |Cite
|
Sign up to set email alerts
|

A Lifetime Optimization Algorithm Limited by Data Transmission Delay and Hops for Mobile Sink-Based Wireless Sensor Networks

Abstract: To improve the lifetime of mobile sink-based wireless sensor networks and considering that data transmission delay and hops are limited in actual system, a lifetime optimization algorithm limited by data transmission delay and hops (LOA_DH) for mobile sink-based wireless sensor networks is proposed. In LOA_DH, some constraints are analyzed, and an optimization model is proposed. Maximum capacity path routing algorithm is used to calculate the energy consumption of communication. Improved genetic algorithm whic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(13 citation statements)
references
References 14 publications
(45 reference statements)
0
13
0
Order By: Relevance
“…On the contrary, a node of a chain-type network with multi-hop communication methods requires more power as it is closer to the base station, since it is subject to a more intense data traffic compared with the one of the most peripheral nodes. This issue is addressed in several papers like [ 47 , 48 , 49 , 50 , 51 ]. There are also some surveys and papers that investigated power optimization algorithms for WSN [ 52 , 53 , 54 , 55 , 56 ].…”
Section: Related Workmentioning
confidence: 99%
“…On the contrary, a node of a chain-type network with multi-hop communication methods requires more power as it is closer to the base station, since it is subject to a more intense data traffic compared with the one of the most peripheral nodes. This issue is addressed in several papers like [ 47 , 48 , 49 , 50 , 51 ]. There are also some surveys and papers that investigated power optimization algorithms for WSN [ 52 , 53 , 54 , 55 , 56 ].…”
Section: Related Workmentioning
confidence: 99%
“…Dividing sensing field into subareas is proposed in [20,21]. Chen et al [20] introduced algorithm to improve the network lifetime considering data transmission delay and number of hops. The algorithm divided the sensing field into grids; the mobile sink has to stay at the grid center for data collection.…”
Section: Related Workmentioning
confidence: 99%
“…← set of nodes in (V , V ) not in ; (15) if is not empty then (16) Flag ← true ; (17) = NRA( , ) ; / * call Node Removal Algorithm * / ← ∪ ; (18) if Flag= false then (19) if V selected as then (20) =index of tree rooted on if is not empty then (13) for each tree index in do (14) get ← number of trees in ; (5) Find the farthest leave vertex V from using ; (6) Find the routing path…”
Section: Farthest Node First-bounded Hop Algorithm (Fnf-bha)mentioning
confidence: 99%
“…Hence, the free space model is used for inter-cluster and intra-cluster communications while the multi-path model is used for transmission to BS. Network latency can be defined as the time lapse between the data packet generated by first node in chain and reception of all packets by BS, illustrated by [1,23,24]:…”
Section: Intelligent Routing Technique For Wireless Sensor Networkmentioning
confidence: 99%