Proceedings of the 3rd international symposium on Information processing in sensor networks
Geographical feature sensitive sensor placement
Journal of Parallel and Distributed Computing
Exact and approximate balanced data gathering in energy-constrained sensor networks
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
Relay node placement in energy-constrained networks using SOMA evolutionary algorithm
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Modeling and simulating coverage in sensor networks
Computer Communications
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
A survey on clustering algorithms for wireless sensor networks
Computer Communications
A heterogeneous role-based sensor network
Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Stream data gathering in wireless sensor networks within expected lifetime
Proceedings of the 3rd international conference on Mobile multimedia communications
Mobile Networks and Applications
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Measurements with different role-based wireless sensor network organizations
Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Design of sensor networks with guaranteed connectivity and lifetime
WICON '07 Proceedings of the 3rd international conference on Wireless internet
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
A reactive role assignment for data routing in event-based wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coverage restoration of wireless sensor networks through the usage of decision trees
AsiaCSN '07 Proceedings of the Fourth IASTED Asian Conference on Communication Systems and Networks
Hard constrained vertex-cover communication algorithm for WSN
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Optimally fast data gathering in sensor networks
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
WSEAS TRANSACTIONS on COMMUNICATIONS
Aggregate node placement for maximizing network lifetime in sensor networks
Wireless Communications & Mobile Computing
Analysis of Sensors' Coverage through Application-Specific WSN Provisioning Tool
International Journal of Mobile Computing and Multimedia Communications
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
Hi-index | 0.00 |
Consider a network of energy-constrained wirelessnodes, capable of sensing and communication, to be deployedover an area to be monitored. There is a set of pointsor regions of interest in that area, each of which must besensed (covered) by at least one node. The nodes are allowedto perform in-network data aggregation. As a nodemay or may not cover one or more points/regions of interest,we allow nodes to assume two roles sensor (nodesthat sense their vicinity and generate data packets) and relay(nodes that only aggregate and transmit data packets).We consider the problem of placing nodes in the monitoringarea and assigning roles to them such that the systemlifetime is maximized, while ensuring that each point/regionof interest is covered by at least one sensor node. This isthe maximum lifetime sensor deployment problem with coverageconstraints. The paper presents a novel algorithmto solve this problem and provides experimental results todemonstrate the effectiveness of the proposed algorithm.