Periodic mobile multi-gateway scheduling

Parallel and Distributed Computing, Applications and Technologies, PDCAT Proceedings

Volumn , Issue , 2008, Pages 195-202

  Almi'ani, Khaled ^a   Selvakennedy, S ^a   Vigias, Anastasios ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

Mobile gateways; Travelling salesman problem; Vehicle routing problem; Wireless sensor network

Indexed keywords

COMPUTER NETWORKS; HYBRID SENSORS; INTEGER PROGRAMMING; LINEARIZATION; NETWORK ROUTING; ROUTING ALGORITHMS; SCHEDULING; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION SYSTEMS; VEHICLE ROUTING; WIRELESS SENSOR NETWORKS;

DIFFERENT FREQUENCIES; INTEGER LINEAR PROGRAMMING FORMULATIONS; MOBILE GATEWAYS; NETWORK LIFETIMES; OPTIMAL RESULTS; PARTITIONED NETWORKS; PROMISING APPROACHES; SENSORS DATUMS; TRAVELLING SALESMAN PROBLEM; VEHICLE ROUTING PROBLEM;

GATEWAYS (COMPUTER NETWORKS);

EID: 58249120099     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PDCAT.2008.36     Document Type: Conference Paper

References (11)

1. A. Kansal, A. Somasundara, D. Jea, M. Srivastava, and D. Estrin, "Intelligent Fluid Infrastructure for Embedded Networks," in Proceedings of the 2nd international conference on Mobile systems, applications, and services (MobiSys), 2004.
2. R. C. Shah, S. Roy, S. Jain, and W. Brunette, "Data mules: Modeling a three-tier architecture for sparse sensor networks," in IEEE Workshop on Sensor Network Protocols and Applications (SNPA), 2003.
3. P. Juang, H. Oki, Y. Wang, M. Martonosi, L. Peh, and D.Rubenstein, "Energy-Efficient Computing for Wildlife Tracking: Design Tradeoffs and Early Experiences with Zebranet," in Proc. 10th Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS), 2002.
4. A. A. Somasundara, A. Ramamoorthy, and M. B. Srivastava, "Mobile Element Scheduling with Dynamic Deadlines," Mobile Computing, IEEE Transactions on, vol. 6, pp. 395 - 410 5-8 Dec 2007.
5. M. R. Garey and D. S. Johnson, "Computers and Intractability, A Guide to the Theory of NPCompleteness," W.H. Freeman and Company, 1979.
6. P.Toth and E. C. Vigo, "The vehicle routing problem," society for industrial and applied Mathematics (SIAM), 2001.
7. M. M. Solomon, "Algorithms for the Vehicle Routing and Scheduling Problems with time window constraints," Operations Research, vol. 35, Mar-Apr 1987.
8. W. Zhao and M. Ammar, "Message ferrying: Proactive routing in highly-partitioned wireless ad hoc networks," in The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems (FTDCS), 2003.
9. Y. Gu, D. Bozdag, E. Ekici, F. Ozguner, and C.-G. Lee, " Partitioning based mobile element scheduling in wireless sensor networks," in Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005. 2005 Second Annual IEEE Communications Society Conference on 2005, pp. 386-395.
10. T. H. Cormen, C. E. LEISERSON, R. L. RIVEST, and C. Stein, in Introduction to Algorithms, 2001, pp. 1012-1013.
11. C. E. Miller, A. W. Tucker, and R. A. Zemlin, "Integer programming formulations and traveling salesman problems," Journal of the Association for Computing Machinery 7, pp. 326-329, 1960.