2015
DOI: 10.1186/s13638-015-0488-x
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive traffic MAC protocol based on correlation of nodes

Abstract: EA-MAC protocol is proposed on the basis of SMAC protocol to remedy the shortcomings of SMAC. In the EA-MAC, node correlation analysis algorithm and traffic adaptive duty cycle mechanism are added. Meanwhile, the residual energy is introduced into the existing traffic adaptive back-off mechanism to measure the saving efficiency. In the node correlation algorithm, all network nodes are divided into several areas by computing node correlation according to the collected information. The clustering mechanism is ap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(19 citation statements)
references
References 30 publications
0
19
0
Order By: Relevance
“…Dynamic S-MAC adjusts the frame length depending on the traffic status on the network in order to enhance S-MAC's energy consumption [15]. EA-MAC adds the node correlation analysis algorithm and traffic-adaptive duty cycle mechanism to make up for the disadvantages of S-MAC [16]. Kim and Ryoo et al [17,18] propose a method that maximizes the entire system's energy life span in consideration of the fact that smart sensor nodes near the sink node consumes more energy than those far from it.…”
Section: Introductionmentioning
confidence: 99%
“…Dynamic S-MAC adjusts the frame length depending on the traffic status on the network in order to enhance S-MAC's energy consumption [15]. EA-MAC adds the node correlation analysis algorithm and traffic-adaptive duty cycle mechanism to make up for the disadvantages of S-MAC [16]. Kim and Ryoo et al [17,18] propose a method that maximizes the entire system's energy life span in consideration of the fact that smart sensor nodes near the sink node consumes more energy than those far from it.…”
Section: Introductionmentioning
confidence: 99%
“…As shown in Figure 5, the maximum distance of the node to the 6 S Delaunay neighbor nodes 2 S , 4 S , 5 S , 7 S , and 9 S is 5 6 S S and S 5 6 R S S  , so 6 S is distinguished as the redundant node.…”
Section: Distinguish the Redundant Nodesmentioning
confidence: 99%
“…In the aspect of redundant node algorithm, Nicolas D. Georganas proposed a "qualified sleep criterion" for random delay messages to make the redundant nodes dormant, (COBS) algorithm [7][8], as shown in Figure 4 COBS algorithm makes use of a random delay of the multi round selection mechanism, and in each round, all nodes in the network need to determine whether it is a redundant node and whether it can be dormant. As shown in Figure 4, the node has a total of four states, that is, ready-on-duty (preparatory work), on-duty (work), ready-to-off and off-duty.…”
Section: Problem Of Redundant Coverage and Related Algorithmsmentioning
confidence: 99%
“…In 2015, Donghong Xu and Ke Wang, et al in proposed EA-MAC, an adaptive traffic aware MAC protocol based on correlation of nodes [13]. They also made duty cycle adaptive based on the bases of predicted flow on the node.…”
Section: Listen Timementioning
confidence: 99%