Sciweavers

179 search results - page 23 / 36
» A Pseudo-Distance Routing (PDR) Algorithm for Mobile Ad-hoc ...
Sort
View
MOBIHOC
2002
ACM
14 years 7 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
CIIT
2004
102views Communications» more  CIIT 2004»
13 years 9 months ago
A swarm intelligence routing algorithm for MANETs
This paper presents a novel swarm intelligence inspired routing algorithm (EARA) for mobile ad hoc networks. Based on the understanding of the evolutionary cooperation in the biol...
Zhenyu Liu, Marta Z. Kwiatkowska, Costas C. Consta...
TMC
2008
192views more  TMC 2008»
13 years 7 months ago
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
Calin Curescu, Simin Nadjm-Tehrani
IAJIT
2007
146views more  IAJIT 2007»
13 years 7 months ago
Adaptive Optimizing of Hello Messages in Wireless Ad-Hoc Networks
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
Essam Natsheh, Adznan B. Jantan, Sabira Khatun, Su...
ISCC
2009
IEEE
158views Communications» more  ISCC 2009»
14 years 2 months ago
Connectivity and critical point behavior in mobile ad hoc and sensor networks
— A well-known approach to increase the resilience of mobile ad hoc networks (MANETs) and unstructured sensor networks is to ensure a network topology where there are at least k ...
Tae-Hoon Kim, David Tipper, Prashant Krishnamurthy