A best fit relocation approach for heterogeneous sensor networks

Wireless Personal Communications

Volumn 65, Issue 4, 2012, Pages 733-751

  Mageid, Salah Abdel ^a   Zaki, Mohamed ^a  

^a Al Azhar University   (Egypt)

Author keywords

Best Fitting; Computatinal geometry algorithms; Heterogeneous sensor networks; Sensor relocation

Indexed keywords

BEST FIT; BEST FITTING; COMPUTATIONAL GEOMETRY ALGORITHMS; FIELD BOUNDARIES; HETEROGENEOUS SENSOR NETWORKS; HETEROGENEOUS SENSORS; LARGE SCALE SENSOR NETWORK; RELOCATION APPROACH; RUNNING TIME; SENSING DEVICES; SENSOR CHARACTERISTICS; SENSOR RELOCATION;

ALGORITHMS; NETWORK PERFORMANCE; SENSORS;

SENSOR NETWORKS;

EID: 84864623970     PISSN: 09296212     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11277-011-0282-y     Document Type: Article

References (23)

1. Akyildiz, I., Su, W., Sankarasubramaniam, Y., & Cayirci, E. (2002). A survey on sensor networks. IEEE Communications Magazine, 40(8), 102-116.
2. Sohraby, K., Minoli, D., & Zntai, T. (2007). Wireless sensor networks: Technology, protocols, and applications. Hoboken, New Jersey: John Wiley and Sons Inc.
3. Burrell, J., Brooke, T., & Beckwith, R. (2004). Vineyard computing: Sensor networks in agricultural production. IEEE Pervasive Computing, 3(1), 38-45.
4. Hussain, S., Erdogen, S., & Park J. (2009). Monitoring user activities in smart home environments. Information Systems Frontiers, Springer 11(5), 539-549.
5. Kewei, S., Weisong, S., & Watkins, O. (2006). Using wireless sensor networks for fire rescue applications: Requirements and challenges. IEEE International conference on electro/information technology, pp. 239-244. (Pubitemid 46970113)
6. Ramadan, R., & Abdel-Mageid, S. (2010). Efficient deployment of connected sensing devices using circle packing algorithms. IEEE international conference on autonomous and intelligent systems (AIS).
7. Fan, J., & Parish, D. (2008). Optimization of wireless sensor networks design using a genetic algorithm. Parallel and distributed computing and systems proceedings, ACTA Press.
8. Ramadan, R., Abdelghany, K., & El-Rewini, H. (2007). Optimal and approximate approaches for deployment of heterogonous sensing devices. EURASIP Journal on Wireless Communications and Networking, 2007. doi:10.1155/2007/54731. (Pubitemid 46609342)
9. Wang, G., Cao, G., & LaPorta, T. (2004). Movement-assisted sensor deployment. In Proceedings IEEE INFOCOM, pp. 2469-2479.
10. Wang, G., Cao, G., & LaPorta, T. (2007). Bidding protocols for deploying mobile sensors. IEEE Transactions on Mobile Computing, 6(5), 515-528. (Pubitemid 46495733)
11. Ma, M., & Yang, Y. (2007). Adaptive triangular deployment algorithm for unattended mobile sensor networks. IEEE Transactions on Computers, 56(7), 946-958. (Pubitemid 47249809)
12. Howard, A., Mataric, M. J., & Sukhatme, G. S. (2002). Mobile sensor network deployment using potential fields: A distributed scalable solution to the area coverage problem. In Proceedings of the 6th international conference on distributed autonomous robotic systems (DARS02) (pp. 299-308). Fukuoka, Japan.
13. Zou, Y., & Chakrabarty, K. (2003). Sensor deployment and target localizations based on virtual forces. In Proceedings of IEEE Infocom.
14. Abdel-Mageid, S., & Ramadan, R. (2010). Efficient deployment algorithms for mobile sensor networks. IEEE international conference on autonomous and intelligent systems (AIS).
15. Niculescu, D., & Nath, B. (2003). Ad Hoc positioning systems (APS) Using AoA. In Proceedings IEEE INFOCOM.
16. Savvides, A., Han, C., & Strivastava, M. B. (2001). Dynamic fine-grained localization in Ad-Hoc networks of sensors. In Proceedings ACM MobiCom.
17. de Berg, M., van Kreveld, M., Overmars, M., & Schwarzkopf, O. (1997). Computational geometry algorithms and applications. second, Revised Edn. (2000) Berlin: Springer-Verlag.
18. Cormen, T., Leiserson, C., & Rivest, R. (1990). Introduction to algorithms. New York: McGraw-Hill.
19. Wireless sensing networks. (2004). http://wins.rsc.rockwell.com.
20. Berkeley sensor and actuator center. (2004). http://www.bsac.eecs. berkeley.edu.
21. Rudolph, G. (1997). How mutation and selection solve long-path problems in polynomial expected time. Evolutionary Computation, 4(2), 195-205. (Pubitemid 126706156)
22. Jansen, T., & Wegener, I. (2001). Evolutionary algorithms - how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Transactions on Evolutionary Computation, 5, 589-599. (Pubitemid 34091917)
23. Neumann, F., & Witt, C. (2006). Runtime analysis of a simple ant colony optimization algorithm. In Proceedings of the 17th international symposium on algorithms and computation (ISAAC '06), 4288 (pp. 618-627). Springer.