Delay constrained optimal relay placement for planned wireless sensor networks

IEEE International Workshop on Quality of Service, IWQoS

Volumn , Issue , 2010, Pages

  Bhattacharya, Abhijit ^a   Kumar, Anurag ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

MEAN DELAYS; NETWORK DESIGN; NETWORK SCENARIO; NP-HARD; POLYNOMIAL TIME COMPLEXITY; RELAY LOCATION; RELAY NODE; SOURCE NODES; WIRELESS SENSOR NETWORK DESIGNS;

APPROXIMATION ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; QUALITY CONTROL; QUALITY OF SERVICE; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 77956598649     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQoS.2010.5542760     Document Type: Conference Paper

References (18)

1. "www.honeywell.com/ps/wireless.".
2. "www.isa.org/isa100.".
3. R. A. Sajana, R. Subramanian, P. V. Kumar, S. Krishnan, B. Amrutur, J. Sebastian, M. Hegde, and S. Anand, "A lowcomplexity algorithm for intrusion detection using a pir-based wireless sensor network," in International Conference Series on Intelligent Sensors, Sensor Networks and Information Processing, (Sydney), 2009.
4. "en.wikipedia.org/wiki/steiner tree problem.".
5. F. K. Hwang, D. S. Richards, and P. Winter, The Steiner Tree Problem, vol. 53 of Annals of Discrete Mathematics. Elsevier Science Publishers B.V, 1992.
6. V. V. Vazirani, Approximation Algorithms. Springer, 1st ed., 2001.
7. G.-H. Lin and G. Xue, "Steiner tree problem with minimum number of Steiner points and bounded edge length," Information Processing Letters, vol. 69, pp. 53-57, 1999.
8. X. Cheng, D.-Z. Du, L. Wang, and B. Xu, "Relay sensor placement in wireless sensor networks," Wireless Netw, vol. 14, pp. 347-355, 2008. (Pubitemid 351704965)
9. E. L. Lloyd and G. Xue, "Relay node placement in wireless sensor networks," IEEE Transactions on Computers, vol. 56, January 2007.
10. S. Voss, "The Steiner tree problem with hop constraints," Annals of Operations Research, vol. 86, pp. 321-345, 1999.
11. A. M. Costa, J.-F. Cordeau, and G. Laporte, "Fast heuristics for the steiner tree problem with revenues, budget and hop constraints," European Journal of Operational Research, vol. 190, pp. 68-78, 2008.
12. M. Kim, Y.-C. Bang, and H. Choo, "On multicasting Steiner trees for delay and delay variation constraints," 2006.
13. J. L. Bredin, E. D. Demaine, M. T. Hajiaghayi, and D. Rus, "Deploying Sensor Networks with Guaranteed Capacity and Fault Tolerance," in MobiHoc'05, ACM, 2005.
14. S. Misra, S. D. Hong, G. Xue, and J. Tang, "Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements," in IEEE INFOCOM, 2008.
15. I. C. Society, IEEE Standards Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (LR-WPANs). New York, October 2003.
16. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Bell Telephone Laboratories, Inc., 1979.
17. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms. The MIT Press and McGraw-Hill, 2 ed., 2001.
18. C. K. Singh, A. Kumar, and P. M. Ameer, "Performance Evaluation of an IEEE 802.15.4 Sensor Network with a Star Topology," Wireless Network, vol. 14, pp. 543-568, 2008.