Abstract
Mobile wireless sensor networks may be applied to diverse areas, and have been receiving increasingly attentions. However, these studies do not seem to address the issue regarding how group of mobile sensor nodes move autonomously, explore and monitor area of interest without exploiting geographic information. Accordingly, this paper develops two amoeba-like algorithms, folding and elastic algorithms, to cope with the above mentioned problem. Folding algorithm operates by assigning some mobile sensor node stay in each intersection, so that it can guide and coordinate the movement of the whole group. Elastic algorithm selects a cluster head for commanding movement directions of the remaining nodes to collect necessary geographic information and determine the subsequent movements. Simulations are conducted to evaluate the two proposed algorithms.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 248-253 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781479942664 |
| DOIs | |
| Publication status | Published - 2014 Oct 3 |
| Event | 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014 - Ulaanbaatar, Mongolia Duration: 2014 Jul 12 → 2014 Jul 14 |
Publication series
| Name | Proceedings - 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014 |
|---|
Other
| Other | 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014 |
|---|---|
| Country | Mongolia |
| City | Ulaanbaatar |
| Period | 14-07-12 → 14-07-14 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Computational Theory and Mathematics
- Software
Cite this
}
Amoeba-like exploring for grouped mobile wireless sensor networks. / Yu, Chang Wu; Wu, Tung-Kuang; Cheng, Rei Heng; Wang, Chien Yeh; Ouyang, Wen.
Proceedings - 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 248-253 6916362 (Proceedings - 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Amoeba-like exploring for grouped mobile wireless sensor networks
AU - Yu, Chang Wu
AU - Wu, Tung-Kuang
AU - Cheng, Rei Heng
AU - Wang, Chien Yeh
AU - Ouyang, Wen
PY - 2014/10/3
Y1 - 2014/10/3
N2 - Mobile wireless sensor networks may be applied to diverse areas, and have been receiving increasingly attentions. However, these studies do not seem to address the issue regarding how group of mobile sensor nodes move autonomously, explore and monitor area of interest without exploiting geographic information. Accordingly, this paper develops two amoeba-like algorithms, folding and elastic algorithms, to cope with the above mentioned problem. Folding algorithm operates by assigning some mobile sensor node stay in each intersection, so that it can guide and coordinate the movement of the whole group. Elastic algorithm selects a cluster head for commanding movement directions of the remaining nodes to collect necessary geographic information and determine the subsequent movements. Simulations are conducted to evaluate the two proposed algorithms.
AB - Mobile wireless sensor networks may be applied to diverse areas, and have been receiving increasingly attentions. However, these studies do not seem to address the issue regarding how group of mobile sensor nodes move autonomously, explore and monitor area of interest without exploiting geographic information. Accordingly, this paper develops two amoeba-like algorithms, folding and elastic algorithms, to cope with the above mentioned problem. Folding algorithm operates by assigning some mobile sensor node stay in each intersection, so that it can guide and coordinate the movement of the whole group. Elastic algorithm selects a cluster head for commanding movement directions of the remaining nodes to collect necessary geographic information and determine the subsequent movements. Simulations are conducted to evaluate the two proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=84910087217&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910087217&partnerID=8YFLogxK
U2 - 10.1109/U-MEDIA.2014.15
DO - 10.1109/U-MEDIA.2014.15
M3 - Conference contribution
AN - SCOPUS:84910087217
T3 - Proceedings - 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014
SP - 248
EP - 253
BT - Proceedings - 2014 7th International Conference on Ubi-Media Computing and Workshops, U-MEDIA 2014
PB - Institute of Electrical and Electronics Engineers Inc.
ER -