2013
DOI: 10.1007/s11276-013-0607-8
|View full text |Cite
|
Sign up to set email alerts
|

Minimizing broadcast latency and redundancy in asynchronous wireless sensor networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 28 publications
0
4
0
Order By: Relevance
“…Although broadcasting is the severe rivalry of energy aware routing, it is the vital part of most of the routing features like cluster formation, cluster head election, cluster head rotation, path establishment, forwarding node selection, setting up a neighbor table and routing table, path maintenance, and so on. Due to its core importance in these functionalities, ideas are floated, and solutions are proposed to minimize message broadcasting [62] and beacon message exchange [63]. A routing algorithm with minimum broadcast in the stringent constraint energy factor environment is appreciated in the research community.…”
Section: Analysis Of Factors Affecting the Energy Aware Routing Functmentioning
confidence: 99%
“…Although broadcasting is the severe rivalry of energy aware routing, it is the vital part of most of the routing features like cluster formation, cluster head election, cluster head rotation, path establishment, forwarding node selection, setting up a neighbor table and routing table, path maintenance, and so on. Due to its core importance in these functionalities, ideas are floated, and solutions are proposed to minimize message broadcasting [62] and beacon message exchange [63]. A routing algorithm with minimum broadcast in the stringent constraint energy factor environment is appreciated in the research community.…”
Section: Analysis Of Factors Affecting the Energy Aware Routing Functmentioning
confidence: 99%
“…However, construction an optimal CDS is NPcomplete [6]. Whereas the goal of paper [7] is to assign distinct slots to the nodes in CDS so that every node rebroadcasts a message without causing collision. Instead of finding CDS beforehand, they try to assign and adjust a slot number to a node depending on the distance from the node to a sink to resolve the collision.…”
Section: Introductionmentioning
confidence: 99%
“…Various protocols for the transmission of a command message have been proposed so far and can be divided into three categories: flooding [ 3 , 4 ], selective rebroadcasting [ 5 , 6 , 7 , 8 , 9 , 10 , 11 ], and tree-based rebroadcasting [ 12 , 13 , 14 ]. The first category is a brute-force flooding approach in which a node rebroadcasts a received message after a random delay if it receives the message for the first time.…”
Section: Introductionmentioning
confidence: 99%
“…Finding the optimal CDS is known to be NP-complete [ 15 ]. Thus, in paper Reference [ 9 ], instead of finding a CDS, they try to assign a broadcast slot number incrementally to a node according to the distance from the node to a sink, and adjust the broadcast slot numbers for multiple nodes of the same distance to remove the possibility of collision. However, the change in topology causes the reconstruction of a CDS or the update of the random number table used for slot number assignment.…”
Section: Introductionmentioning
confidence: 99%