2008
DOI: 10.1016/s1672-6529(08)60025-6
|View full text |Cite
|
Sign up to set email alerts
|

Blackboard Mechanism Based Ant Colony Theory for Dynamic Deployment of Mobile Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…ACO has been used for maximizing the network lifetime in WSN. The autonomy and dynamic deployment of mobile sensor networks was effectively solved using a blackboard mechanism based ant colony theory by Qi and Li in [17]. The algorithm reduced the power consumption by 13%, enhanced the efficiency of path planning and deployment of WSN by 15%.…”
Section: B Aco and Network Lifetimementioning
confidence: 99%
“…ACO has been used for maximizing the network lifetime in WSN. The autonomy and dynamic deployment of mobile sensor networks was effectively solved using a blackboard mechanism based ant colony theory by Qi and Li in [17]. The algorithm reduced the power consumption by 13%, enhanced the efficiency of path planning and deployment of WSN by 15%.…”
Section: B Aco and Network Lifetimementioning
confidence: 99%
“…and parameters have been taken as 7 meters and 2 (14 meters), respectively. Two scenario were done for each case study, and the OPT LOWERBOUND DIST, OPT UPPERBOUND DIST and MAX CONVERGENCE DIST parameters have been taken as √ 3 , √ 3.2 , and √ 1 in the 1st scenario and as [] then (5) for j = 1 to OPT SENSORS COUNT do (6) if ( , ) between OPT LOWERBOUND DIST and OPT UPPERBOUND DIST then (7) OPT NEIGHBOUR COUNT ← OPT NEIGHBOUR COUNT + 1 (8) else if ( , ) < MAX CONVERGENCE DIST (9) NONOPT NEIGHBOUR COUNT ← NONOPT NEIGHBOUR COUNT + 1 (10) end if (11) end for (12) if (NONOPT NEIGHBOUR COUNT == 0 AND OPT NEIGHBOUR COUNT >= 1) then (13) OPT SENSORS COUNT ← OPT SENSORS COUNT + 1 (14) OPT √ 3 , √ 3.5 , and √ 1.3 in the 2nd scenario, respectively. The OPT NEIGHBOUR COUNT parameter has been taken as 1 to be common for both the scenarios in the case studies except for the case study 3.…”
Section: Parameter Selection For the Suggested Algorithm Based On Emmentioning
confidence: 99%
“…Blackboard mechanism-based ant colony theory [10] which is a novel bionic swarm intelligence algorithm has been applied to the dynamic deployment problems of mobile sensor networks.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, the active deployment of the sensors in the area is possible by performing the deterministic deployment of nodes. The node deployment made by using meta-heuristic algorithms [6,7], which is also the subject of this article, serves as an example of the deterministic deployment in WSNs.…”
Section: Introductionmentioning
confidence: 99%