Distributed graph coloring in wireless ad hoc networks: a light-weight algorithm based on Japanese tree frogs' calling behaviour

Inicio | ¿Qué es? | Contacto

English | Català

Consultar RECERCAT

Por comunidades y
colecciones Por fecha Por autores Por títulos Por temas (CDU)

Consultar departamento

Por fecha Por autores Por títulos Por temas (CDU)

Estadisticas

Del documento Todo RECERCAT

Mi RECERCAT

Entrar Alertas por correo-e

Directorio de otros repositorios

RECERCAT Principal > Universitat Politècnica de Catalunya > Documents de recerca > Visualizar documento

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/18865

dc.contributor	Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.contributor.author	Hernández Pibernat, Hugo
dc.contributor.author	Blum, Christian
dc.date	2011
dc.identifier.citation	Hernandez, H.; Blum, C. Distributed graph coloring in wireless ad hoc networks: a light-weight algorithm based on Japanese tree frogs' calling behaviour. A: Wireless and Mobile Networking Conference. "Proceedings of 2011 4th Joint IFIP Wireless and Mobile Networking Conference: WMNC 2011: October 26-28, 2011, Toulouse, France: proceedings". Toulouse: IEEE, 2011, p. 1-7.
dc.identifier.citation	978-1-4577-1192-3
dc.identifier.citation	10.1109/WMNC.2011.6097216
dc.identifier.uri	http://hdl.handle.net/2117/18865
dc.language.iso	eng
dc.publisher	IEEE
dc.relation	http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=6097216&tag=1
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Enginyeria de la telecomunicació::Telemàtica i xarxes d'ordinadors
dc.subject	Ad hoc networks
dc.subject	Distributed algorithms
dc.subject	Graph colouring
dc.subject	Xarxes ad hoc
dc.title	Distributed graph coloring in wireless ad hoc networks: a light-weight algorithm based on Japanese tree frogs' calling behaviour
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	Wireless and Mobile Networking Conference (WMNC’11) Best Paper Award
dc.description.abstract	Graph coloring concerns the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. In this paper we deal with the problem of finding valid colorings of graphs in a distributed manner, while minimizing the number of used colors. This problem is at the heart of several problems arising in wireless ad hoc networks. Examples are TDMA slot assignment, wakeup scheduling, and data collection. The proposed algorithm is inspired by the de-synchronization that can be observed in the calling behaviour of male Japanese tree frogs. Experimental results show that our algorithm is very competitive with current state-of-the-art approaches.
dc.description.abstract	Peer Reviewed
dc.description.abstract	Award-winning

Mostrar el registro sencillo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Self-synchronized duty-cycling for mobile sensor networks with energy harvesting capabilities: A swarm intelligence study

Hernández Pibernat, Hugo; Blum, Christian; Middendorf, Martin; Ramsch, Kai; Scheidler, Alexander

A protocol for self-synchronized duty-cycling in sensor networks: Generic implementation in Wiselib

Hernández Pibernat, Hugo; Baumgartner, Tobias; Blesa Aguilera, Maria Josep; Blum, Christian; Kröller, Alexander; Fekete, Sandor P.

Ant colony optimization for broadcasting in sensor networks under a realistic antenna model

Hernández Pibernat, Hugo; Blum, Christian

Hybrid algorithms for the variable sized bin packing problem

Blum, Christian; Hemmelmayr, Vera C.; Hernández Pibernat, Hugo; Schmid, Verena

Foundations of ANTCYCLE: self-synchronized duty-cycling in mobile sensor networks

Hernández Pibernat, Hugo; Blum, Christian

Accesibilidad | Aviso legal | Política de Cookies | Documentos de uso interno

Coordinación

Patrocinio