2013
DOI: 10.1016/j.jocs.2012.01.003
|View full text |Cite
|
Sign up to set email alerts
|

Self-stabilizing algorithm for efficient topology control in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2013
2013
2017
2017

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 40 publications
(22 citation statements)
references
References 12 publications
0
22
0
Order By: Relevance
“…Applications Technique [7] Interference-free localization Maximum flow [10], [32] Nodes deployment Quadratic Assignment [23] Network lifetime Set Cover Problem and variant [30] [43] Routing Graph Coloring Problem [33] Routing Voronoi based path searching [44], [47] Energy Saving Multipath [28] Network lifetime Linear programming [12] QoS Multipath [24] Minimizing Energy Binary Integer Linear Programming [27] Energy saving Mixed Integer Linear Programming [48] Routing and sink location Integer programming [29] Energy Minimum Dominant set [34] Routing Dominant Set [31] Node localization Integer linear programming [38] Node localization Mathematical programing [39] Node localization, network lifetime Linear Programming [41] Interference [7], [10], [27], [29], [32] [34], [41], [43], [45], [48], [49], [52], [58], [59], [62], [65] √ √ [12], [23], [24], [28], [33], [38], [39], [44], [46], …”
Section: Referencesmentioning
confidence: 99%
See 1 more Smart Citation
“…Applications Technique [7] Interference-free localization Maximum flow [10], [32] Nodes deployment Quadratic Assignment [23] Network lifetime Set Cover Problem and variant [30] [43] Routing Graph Coloring Problem [33] Routing Voronoi based path searching [44], [47] Energy Saving Multipath [28] Network lifetime Linear programming [12] QoS Multipath [24] Minimizing Energy Binary Integer Linear Programming [27] Energy saving Mixed Integer Linear Programming [48] Routing and sink location Integer programming [29] Energy Minimum Dominant set [34] Routing Dominant Set [31] Node localization Integer linear programming [38] Node localization Mathematical programing [39] Node localization, network lifetime Linear Programming [41] Interference [7], [10], [27], [29], [32] [34], [41], [43], [45], [48], [49], [52], [58], [59], [62], [65] √ √ [12], [23], [24], [28], [33], [38], [39], [44], [46], …”
Section: Referencesmentioning
confidence: 99%
“…They save energy by considering the information flow exchanged between sensors. Similarly, in [29], authors suggested to reduce the energy consumed by reducing the transmission power of each sensor. Their algorithm finds the connected minimal weighted dominated set, and used it as a support over sensors to route the data, and then idle the remaining nodes.…”
Section: Operations Research Techniques In Energy Savingmentioning
confidence: 99%
“…In other words, the access point is a master node and the other ones are slave nodes. The asymmetric architecture; an access point coupled with few nodes (typically 10), makes global routing protocols applicable to collect data at the access point (Bessaoud, Bui, & Pilard, 2013). However, sensor nodes are equipped with limited energy resources.…”
Section: Introductionmentioning
confidence: 99%
“…1). These patient monitoring systems enable the medical personnel to provide urgent medical aid [2] and prevent patients suffering from poor health condition(s): body stiffness, muscular weaknesses, dependency on the nurses to get their postures changed, etc. The sensors are equipped with limited energy resources.…”
Section: Introductionmentioning
confidence: 99%