An efficient heuristic for placement, scheduling and routing in wireless sensor networks

Authors:
Yavuz Boğaç Türkoğulları;Necati Aras;İ. Kuban Altınel;Cem Ersoy
Affiliations:
Industrial Eng. Dept., Boğaziçi University, İstanbul, Turkey;Industrial Eng. Dept., Boğaziçi University, İstanbul, Turkey;Industrial Eng. Dept., Boğaziçi University, İstanbul, Turkey;Computer Eng. Dept., Boğaziçi University, İstanbul, Turkey
Venue:
Ad Hoc Networks
Year:
2010

Citing 23
Cited 2

A new polynomial-time algorithm for linear programming

Combinatorica
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

IEEE Transactions on Computers
Energy-Aware Routing in Cluster-Based Sensor Networks

MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Maximum lifetime routing in wireless sensor networks

IEEE/ACM Transactions on Networking (TON)
A survey of combinatorial optimization problems in multicast routing

Computers and Operations Research
A survey of application distribution in wireless sensor networks

EURASIP Journal on Wireless Communications and Networking
Maximizing lifetime for data aggregation in wireless sensor networks

Mobile Networks and Applications
Maximal lifetime scheduling for K to 1 sensor-target surveillance networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on wireless multimedia sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy efficient routing with delay guarantee for sensor networks

Wireless Networks
Connected K-target coverage problem in wireless sensor networks with different observation scenarios

Computer Networks: The International Journal of Computer and Telecommunications Networking
Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Controlled sink mobility for prolonging wireless sensor networks lifetime

Wireless Networks
Algorithm design for a class of base station location problems in sensor networks

Wireless Networks
Sleep scheduling for wireless sensor networks via network flow model

Computer Communications
Efficient routing from multiple sources to multiple sinks in wireless sensor networks

EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Maximum lifetime routing and data aggregation for wireless sensor networks

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Maximize the coverage lifetime of sensor networks

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Optimal multi-sink positioning and energy-efficient routing in wireless sensor networks

ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
An optimal node scheduling for flat wireless sensor networks

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
On energy provisioning and relay node placement for wireless sensor networks

IEEE Transactions on Wireless Communications
A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink

IEEE Transactions on Wireless Communications

A robust topology control solution for the sink placement problem in WSNs

Journal of Network and Computer Applications
Wireless sensor network lifetime maximization by optimal sensor deployment, activity scheduling, data routing and sink mobility

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Wireless Mesh Networks (WMNs) can partially replace the wired backbone of traditional wireless access networks and, similarly, they require to carefully plan radio resource assignment in order to provide the same quality guarantees to traffic flows. ...