Sciweavers

1687 search results - page 247 / 338
» On the complexity of scheduling in wireless networks
Sort
View
SASO
2008
IEEE
16 years 23 days ago
Towards Desynchronization of Multi-hop Topologies
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
Julius Degesys, Radhika Nagpal
COOPIS
1997
IEEE
15 years 10 months ago
Design and Implementation of a Distributed Workflow Enactment Service
Workflows are activities involving the coordinated execution of multiple tasks performed by different processing entities, mostly in distributed heterogeneous environments which a...
Esin Gokkoca, Mehmet Altinel, Ibrahim Cingil, Nesi...
CNSR
2007
IEEE
101views Communications» more  CNSR 2007»
16 years 22 days ago
The Theory of Natural Movement and its Application to the Simulation of Mobile Ad Hoc Networks (MANET)
The theory of natural movement is fundamental to space syntax: a set of theories and methods developed in the late 1970s that seeks, at a general level, to reveal the mutual effec...
Nick Sheep Dalton, Ruth Conroy Dalton
CN
2006
111views more  CN 2006»
15 years 6 months ago
Analytical modeling of CAC in next generation wireless systems
Though Connection Admission Control (CAC) in wireless networks has been studied extensively, the heterogeneous structure of Next Generation Wireless Systems (NGWS) makes CAC very ...
Tuna Tugcu, H. Birkan Yilmaz, Feodor S. Vainstein
MOBIHOC
2002
ACM
16 years 6 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder