On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Embedding the Internet: introduction
Communications of the ACM
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks with Unidirectional Links
IEEE Transactions on Parallel and Distributed Systems
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
GPS-Free Positioning in Mobile ad-hoc Networks
HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
A Bidding Protocol for Deploying Mobile Sensors
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Initializing newly deployed ad hoc and sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
The holes problem in wireless sensor networks: a survey
ACM SIGMOBILE Mobile Computing and Communications Review
Using mobile relays to prolong the lifetime of wireless sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Self Distributed Query Region Covering in Sensor Networks
SRDS '05 Proceedings of the 24th IEEE Symposium on Reliable Distributed Systems
Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
SeGrid: a secure grid framework for sensor networks
EURASIP Journal on Wireless Communications and Networking
Sensor replacement using mobile robots
Computer Communications
Improving network lifetime using sensors with adjustable sensing ranges
International Journal of Sensor Networks
TTS: a two-tiered scheduling mechanism for energy conservation in wireless sensor networks
International Journal of Sensor Networks
Review: Coverage and connectivity issues in wireless sensor networks: A survey
Pervasive and Mobile Computing
Perimeter discovery in wireless sensor networks
Journal of Parallel and Distributed Computing
A topology discovery algorithm for sensor network using smart antennas
Computer Communications
EECHE: an energy-efficient cluster head election algorithm in sensor networks
APNOMS'09 Proceedings of the 12th Asia-Pacific network operations and management conference on Management enabling the future internet for changing business and new computing services
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
An improved distributed algorithm for connected dominating sets in wireless ad hoc networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Mobility-based communication in wireless sensor networks
IEEE Communications Magazine
| Hi-index | 0.00 |
All properties of mobile wireless sensor networks (MWSNs) are inherited from static wireless sensor networks (WSNs) and meanwhile have their own uniqueness and node mobility. Sensor nodes in these networks monitor different regions of an area of interest and collectively present a global overview of monitored activities. Since failure of a sensor node leads to loss of connectivity, it may cause a partitioning of the network. Adding mobility to WSNs can significantly increase the capability of the WSN by making it resilient to failures, reactive to events, and able to support disparate missions with a common set of sensor nodes. In this paper, we propose a new algorithm based on the divide-and-conquer approach, in which the whole region is divided into sub-regions and in each sub-region the minimum connected sensor cover set is selected through energy-aware selection method. Also, we propose a new technique for mobility assisted minimum connected sensor cover considering the network energy. We provide performance metrics to analyze the performance of our approach and the simulation results clearly indicate the benefits of our new approach in terms of energy consumption, communication complexity, and number of active nodes over existing algorithms.