Multi-channel scheduling algorithms for fast aggregated convergecast in sensor networks

2009 IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, MASS '09

Volumn , Issue , 2009, Pages 363-372

  Ghosh, Amitabha ^a   Incel, Özlem Durmaz ^b   Kumar, V S Anil ^c   Krishnamachari, Bhaskar ^a  

^a University of Southern California   (United States)

^b BOGAZICI UNIVERSITY   (Turkey)

^c Virginia Polytechnic Institute and State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY NETWORKS; COMMUNICATION PARADIGM; CONSTANT FACTOR APPROXIMATION; CONTINUOUS MONITORING; CONVERGECAST; DATA COLLECTION RATES; DATA PACKET; DISK GRAPH; EN-ROUTE; INTERFERING LINKS; MANY-TO-ONE; MULTI-CHANNEL SCHEDULING ALGORITHM; MULTIPLE FREQUENCY; NETWORK PARAMETERS; NODE DEGREE; NP-HARD; PERFORMANCE GUARANTEES; POLYNOMIAL-TIME ALGORITHMS; ROUTING TOPOLOGY; ROUTING TREES; SCHEDULE LENGTH; SINK NODES; TDMA SCHEDULING; TRANSMISSION RANGES; TREE-BASED ROUTING; UNIT DISK GRAPHS; UPPER BOUND;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA ACQUISITION; DISKS (STRUCTURAL COMPONENTS); POLYNOMIAL APPROXIMATION; SCHEDULING ALGORITHMS; SENSOR NETWORKS; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 74249086496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MOBHOC.2009.5336979     Document Type: Conference Paper

References (23)

1. V. Annamalai, S. Gupta, and L. Schwiebert, "On Tree-Based Convergecasting in Wireless SensorNetworks", in Proceedings of WCNC'03, vol. 3, March 2003, pp. 1942-1947.
2. P. Bahl, R. Chandra, J. Dunagan, "SSCH: Slotted Seeded Channel Hopping for Capacity Improvement in IEEE 802.11 Ad-Hoc Wireless Networks", Proceedings of Mobicom '04, Philadelphia, pp. 216-230.
3. R. Bhatia, M. Kodialam, "On Power Efficient Communication over Multi-hop Wireless Networks: Joint Routing, Scheduling and Power Control", Proceedings of INFOCOM'04, Hong Kong, pp. 1457-1466.
4. M. Burkhart, P. von Rickenbach, R. Wattenhofer, and A. Zollinger, "Does Topology Control Reduce Interference?" in Proceedings of MobiHoc '04, Tokyo, Japan, pp. 9-19.
5. H. Choi, J. Wang, and E.A. Hughes, "Scheduling on Sensor Hybrid Network", in Proceedings of ICCCN'05, San Diego, pp. 505-508.
6. R.L. Cruz and A. Santhanam, "Optimal Routing, Link Scheduling, and Power Control in Multi-hop Wireless Networks", in Proceedings of INFOCOM'03, San Francisco, CA, pp. 702-711.
7. TA. ElBatt and A. Ephremides, "Joint Scheduling and Power Control for Wireless Ad-hoc Networks", IEEE Transactions on Wireless Communications, 3(1):54-85, 2004.
8. RJ. Faudree, A. Gyrfs, R.H. Schelp, Z. Tuza, "The Strong Chromatic Index of Graphs", Ars Combinatoria, B29 (1990), pp. 205-211.
9. S. Gandham, Y. Zhang, and Q. Huang, "Distributed Time-Optimal Scheduling for Convergecast in Wireless Sensor Networks", Computer Networks, 52(3):610-629, 2008.
10. M.R. Garey, D.S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", W.H. Freeman & Company, 1979.
11. R.L. Graham, "Bounds on Multiprocessing Timing Anomalies", SIAM Journal on Applied Mathematics, 17(2):416-429, March 1969.
12. O.D. Incel and BhaskarKrishnamachari "Enhancingthe Data Collection Rate of Tree-Based Aggregation in Wireless Sensor Networks", in Proceedings ofSECON'08, San Francisco, CA, pp. 569-577.
13. S. Madden, MJ. Franklin, J.M. Hellerstein, and W. Hong, "TAG: a Tiny AGgregation Service for Ad-Hoc Sensor Networks", in Proceedings of OSD/'02, Boston,MA, USA, pp. 131-146.
14. J. Mao, Z. Wu, and X. Xu, "A TDMAScheduling Schemefor Many-toOne Communications in Wireless Sensor Networks", Computer Communications, 30(4):863-872, 2007.
15. T Moscibroda, "The Worst-Case Capacity of Wireless Sensor Networks", in Proceedings of IPSN '07, Cambridge, MA, pp. 1-10.
16. O. Ore, The Four-Color Problem, Academic Press, 1967.
17. M.R. Salavatipour, "A Polynomial Time Algorithm for Strong Edge Coloring of Partial k-Trees", Discrete Applied Mathematics 143:(1-3) 2004, pp 285-291.
18. J. So and N. Vaidya, "Multi-Channel MAC for Ad Hoc Networks: HandlingMulti-Channel HiddenTerminals UsingA SingleTransceiver", in Proceedings of MobiHoc'04, Japan, pp. 222-233.
19. W. Wu, H. Du, X. Jia, Y. Li, and S.C.-H. Huang, "Minimum Connected Dominating Sets and Maximal Independent Sets in Unit Disk Graphs", in Theoretical Computer Science, 352(1):1-7, 2006.
20. G. Zhou, C. Huang, T Yan, T. He, J. A. Stankovic, T. F. Abdelzaher, "MMSN: Multi-Frequency Media Access Control for Wireless Sensor Networks", in Proceedings of INFOCOM'06, Barcelona, pp. 1-13.
21. V. S. Anil Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, "End-to-End Packet-Scheduling in Wireless Ad-hoc Networks", in Proceedings of SODA '04, New Orleans, Louisiana, pp. 1021-1030.
22. B. Han, V. S. Anil Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, "Distributed Strategies for Channel Allocation and Scheduling in Software-Defined Radio Networks", Proceedings of Infocom '09, Rio de Janeiro, Brazil.
23. M. Mitzenmacher and E. Upfal, "Probability and Computing: Randomized Algorithms and Probabilistic Analysis", Cambridge University Press, 2005.