Learn More
In this paper we consider the problem of coverage in a wireless sensor network where nodes already have been previously deployed. Our goal is to design an efficient strategy to add further nodes for achieving a certain target K-coverage throughout the entire monitoring region. A heuristic approach based on a dynamic model resembling gas bubbles is applied(More)
1.1 Introduction The development of computer networks has seen a paradigm shift from static, hierarchical network structures to highly distributed, autonomous systems without any form of centralized control. For networking nodes, the ability to self-adapt and self-organize in a changing environment has become a key issue. In conventional network structures,(More)
The Adaptive Base Station Positioning Algorithm (ABPA) is presented, which is based on a neural net approximation of the traac density in the coverage area of a cellular mobile communication system. ABPA employs simulated annealing, thereby achieving quasi-optimal base station locations depending on the topography of the investigated area. Furthermore, ABPA(More)
The heterogeneity of connected devices, technologies, and protocols anticipated in future-generation information and communication networks also requires the development of new approaches for robust and self-adaptive systems. Recently, methods observed from biological phenomena have gained much attention as viable alternatives or inspiration for the(More)