scholarly journals PIYAS-Proceeding to Intelligent Service Oriented Memory Allocation for Flash Based Data Centric Sensor Devices in Wireless Sensor Networks

Sensors ◽  
2009 ◽  
Vol 10 (1) ◽  
pp. 292-312 ◽  
Author(s):  
Sanam Shahla Rizvi ◽  
Tae-Sun Chung
2020 ◽  
pp. 1580-1600
Author(s):  
Subhendu Kumar Pani

A wireless sensor network may contain hundreds or even tens of thousands of inexpensive sensor devices that can communicate with their neighbors within a limited radio range. By relaying information on each other, they transmit signals to a command post anywhere within the network. Worldwide market for wireless sensor networks is rapidly growing due to a huge variety of applications it offers. In this chapter, we discuss application of computational intelligence techniques in wireless sensor networks on the coverage problem in general and area coverage in particular. After providing different types of coverage encountered in WSN, we present a possible classification of coverage algorithms. Then we dwell on area coverage which is widely studied due to its importance. We provide a survey of literature on area coverage and give an account of its state-of-the art and research directions.


Author(s):  
Subhendu Kumar Pani

A wireless sensor network may contain hundreds or even tens of thousands of inexpensive sensor devices that can communicate with their neighbors within a limited radio range. By relaying information on each other, they transmit signals to a command post anywhere within the network. Worldwide market for wireless sensor networks is rapidly growing due to a huge variety of applications it offers. In this chapter, we discuss application of computational intelligence techniques in wireless sensor networks on the coverage problem in general and area coverage in particular. After providing different types of coverage encountered in WSN, we present a possible classification of coverage algorithms. Then we dwell on area coverage which is widely studied due to its importance. We provide a survey of literature on area coverage and give an account of its state-of-the art and research directions.


Author(s):  
Sami Habib

The evolutionary search approach has demonstrated its effectiveness in many real world applications, such as the coverage problem in wireless sensor networks. It is to place sensor devices in a service area so that the entire service area is covered. We have modeled the coverage problem as two sub-problems: floorplan and placement. The floorplan problem is to partition the service area into well-defined geometric cells, where the placement problem is to assign the sensor devices into a set of cells. Even though the search space has been transformed from continuous into discrete, the complexity of the coverage problem is computationally intensive. The objective function is to maximize the coverage of the service area while not exceeding a given budget. The merged optimization problem has been coded into the genetic algorithm (GA) and the experimental results reveal the versatility of GA to adapt and find a good solution in a short time.


Sign in / Sign up

Export Citation Format

Share Document