Area k-Coverage Optimization Protocol for Heterogeneous Dense Wireless Sensor Networks
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2017, Vol 8, Issue 10
Abstract
Detecting redundant nodes and scheduling their activity is mandatory to prolong the lifetime of a densely-deployed wireless sensor network. Provided that the redundancy check and the scheduling phases both help to preserve the coverage ratio and guarantee energy efficiency. However, most of the solutions usually proposed in the literature, tend to allocate a large number of unnecessary neighbor (re)discovery time slots in the dutycycle of the active nodes. Such a shortcoming is detrimental to battery power conservation. In this paper, we propose a crossing points-based heuristic to fast detect redundant nodes even in heterogeneous networks; then, an integer linear program and a local exclusion based strategy to respectively, formulate and solve the sensing unit scheduling problem. Simulations show that the resulting localized asynchronous protocol outperforms some state-of-the-art solutions with respect to coverage preservation and network lifetime enhancement.
Authors and Affiliations
Hervé Gokou Diédié, Boko Aka, Michel Babri
Keywords
Related Articles
- EP ID EP262273
- DOI 10.14569/IJACSA.2017.081043
- Views 81
- Downloads 0
Impact of Security in QoS Signaling in NGN: Registration Study
New generation networks (NGN) use an IP base to transmit their services as well as voice, video and other services. The IP Multimedia Subsystem (IMS) which represents the network core, allowed controls and accesses into...
Cost Optimization of Replicas in Tree Network of Data Grid with QoS and Bandwidth Constraints
Data Grid provides resources for data-intensive scientific applications that need to access a huge amount of data around the world. Since data grid is built on a wide-area network, its latency prohibits efficient access...
Simulation of a WiMAX network to evaluate the performance of MAC IEEE 802.16 during the IR phase of Network Entry and Initialization
Pervasive Computing is also called as Ubiquitous Computing, which means “being present everywhere at once” or “constantly encountered”. The main idea behind making these pervasive computing systems is that these systems...
An Effective Lightweight Cryptographic Algorithm to Secure Resource-Constrained Devices
In recent years, small computing devices like embedded devices, wireless sensors, RFID tags (Radio Frequency Identification), Internet of Things (IoT) devices are increasing rapidly. They are expected to generate massive...
A Conversion of Empirical MOS Transistor Model Extracted From 180 nm Technology To EKV3.0 Model Using MATLAB
In this paper, the EKV3.0 model used for RF analog designs was validated in all-inversion regions under bias conditions and geometrical effects. A conversion of empirical data of 180nm CMOS process to EKV model was propo...