SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks

IWCMC 2008 - International Wireless Communications and Mobile Computing Conference

Volumn , Issue , 2008, Pages 511-516

  Minet, Pascale ^a   Mahfoudh, Saoucene ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; COLORING; KETONES; MOBILE COMPUTING; ROUTERS; SENSOR NETWORKS; SENSORS; TELECOMMUNICATION; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

COLORING ALGORITHMS; NETWORK FUNCTIONALITY; NETWORK LIFE-TIME; PERFORMANCE EVALUATION; ROUTER NODES; TIME SLOT; TIME SLOTTING; TRAFFIC RATES; USER DATA; WIRELESS AD HOC AND SENSOR NETWORKS; WIRELESS COMMUNICATIONS;

WIRELESS SENSOR NETWORKS;

EID: 52949120364     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWCMC.2008.89     Document Type: Conference Paper

References (17)

1. S. Mahfoudh, P. Minet, Survey of energy efficient strategies in wireless ad hoc and sensor networks, ICN 2008, Cancun, Mexico, April 2008.
2. L. Feeney, M. Nilson, Investigating the energy consumption of a wireless network interface, in an ad hoc networking environment, IEEE INFOCOM 2001, Anchorage, Alaska, April 2001.
3. M. Cardei, M. Thai, Y. Li, W. Wu, Energy-efficient target coverage in wireless sensor networks, IEEE INFOCOM 2005, Miami, Florida, March 2005.
4. M. Cardei, D. Du, Impmving wireless sensor network lifetime through power aware organization, ACM Journal of Wireless Networks, May 2005.
5. J. Carle, D. Simplot-Ryl, Energy-Efficient Area Monitoring for Sensor Networks, Computer, vol. 37, no. 2, pp. 40-46, Febuary, 2004.
6. D. Brelaz, New methods to color the vertices of a graph, Communications of the ACM, 22(4), 1979.
7. J. Peemoller, A correction to Brelaz's modification of Brown's coloring algorithm, Communications of the ACM, 26(8), 1983.
8. M. Garey, D. Johnson, Computers and intractability: a guide to theory of NP-completeness, W.H. Freeman, San Francisco, California, 1979.
9. I. Finoccho, A. Panconesi, R. Silvestri, Experimental analysis of simple distributed vertex coloring algorithms, SODA 2002, San francisco, California, January 2002.
10. J. Hansen, M. Kubale, L. Kuszner, A. Nadolski, Distributed largest-first algorithm for graph coloring, EURO-PAR 2004, Pisa, Italy, August 2004.
11. T. Herman, S. Tixeuil, A distributed TDMA slot assignment algorithm for wireless sensor networks, ALGOSENSORS 2004, Turku, Finland, July 2004.
12. V. Rajendran, K. Obraczka, J.J. Garcia-Luna-Aceves, Energy-efficient, collision-free medium access control for wireless sensor networks, Sensys'03, Los Angeles, California November 2003.
13. V. Rajendran, J.J. Garcia-Luna-Aceves, K. Obraczka, Energy-efficient, application-aware medium access for sensor networks, IEEE MASS 2005, Washington, November 2005.
14. C. Busch, M. Magdon-Ismail, F. Sivrikaya, B. Yener, Contention-free MAC protocols for wireless sensor networks, DISC 2004, Amsterdam, Netherlands, October 2004.
15. F. Kuhn, R. Watttenhofer, On the complexity of distributed graph coloring, PODC 2006, Denver, Colorado, USA, July 2006.
16. C. Adjih, T. Clausen, P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, L. Viennot, Optimized Link State Routing Protocol, RFC 3626, IETF, 2003.
17. S. Mahfoudh, P. Minet, An energy efficient muting based on OLSR in wireless ad hoc and sensor networks, PAEWN 2008, Ginowan, Japan, March 2008.