Results 1 - 10
of
113
Protocols for self-organization of a wireless sensor network
- IEEE Personal Communications
, 2000
"... We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation ..."
Abstract
-
Cited by 269 (2 self)
- Add to MetaCart
We present a suite of algorithms for self-organization of wireless sensor networks, in which there is a scalably large number of mainly static nodes with highly constrained energy resources. The protocols further support slow mobility by a subset of the nodes, energy-efficient routing, and formation of ad hoc subnetworks for carrying out cooperative signal processing functions among a set of the nodes.
Lanmar: Landmark routing for large scale wireless ad hoc networks with group mobility
- in Proceedings of IEEE/ACM MobiHOC 2000
, 2000
"... In this paper, we present a novel routing protocol for wireless
ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR com-
bines the features of Fisheye State Routing (FSR) and Landmark routing.
The key novelty is the use of landmarks for each set of nodes which move as
a group (e.g., a team o ..."
Abstract
-
Cited by 120 (13 self)
- Add to MetaCart
In this paper, we present a novel routing protocol for wireless
ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR com-
bines the features of Fisheye State Routing (FSR) and Landmark routing.
The key novelty is the use of landmarks for each set of nodes which move as
a group (e.g., a team of co-workers at a convention or a tank battalion in the
battlefield) in order to reduce routing update overhead. Like in FSR, nodes
exchange link state only with their neighbors. Routes within Fisheye scope
are accurate, while routes to remote groups of nodes are “summarized” by
the corresponding landmarks. A packet directed to a remote destination ini-
tially aims at the Landmark; as it gets closer to destination it eventually
switches to the accurate route provided by Fisheye. Simulation experiments
show that LANMAR provides efficient and scalable routing in large, mobile,
ad hoc environments in which group mobility applies.
Fisheye State Routing: A Routing Scheme for Ad Hoc Wireless Networks
- IN PROCEEDINGS OF ICC 2000
, 2000
"... This paper presents a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which depends ..."
Abstract
-
Cited by 115 (5 self)
- Add to MetaCart
This paper presents a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which depends on distance to destination. From link state entries, nodes construct the topology map of the entire network and compute optimal routes. Simulation experiments show that FSR is a simple, efficient and scalable routing solution in a mobile, ad hoc environment.
Centralized Channel Assignment and Routing Algorithms for Multi-channel Wireless Mesh Networks
- ACM Mobile Computing and Communications Review
, 2004
"... this paper, we propose and evaluate one of the first multi-channel multi-hop wireless ad-hoc network architectures that can be built using standard 802.11 hardware by equipping each node with multiple network interface cards (NICs) operating on different channels. We focus our attention on wireless ..."
Abstract
-
Cited by 95 (1 self)
- Add to MetaCart
this paper, we propose and evaluate one of the first multi-channel multi-hop wireless ad-hoc network architectures that can be built using standard 802.11 hardware by equipping each node with multiple network interface cards (NICs) operating on different channels. We focus our attention on wireless mesh networks that serve as the backbone for relaying end-user traffic from wireless access points to the wired network. The idea of exploiting multiple channels is particularly appealing in wireless mesh networks because of their high capacity requirements to support backbone traffic
Integrated Cellular and Ad Hoc Relaying Systems: iCAR
- IEEE Journal on Selected Areas in Communications
, 2001
"... Integrated cellular and ad hoc relaying systems (iCAR) is a new wireless system architecture based on the integration of cellular and modern ad hoc relaying technologies. It addresses the congestion problem due to unbalanced traffic in a cellular system and provides interoperability for heterogeneou ..."
Abstract
-
Cited by 84 (5 self)
- Add to MetaCart
Integrated cellular and ad hoc relaying systems (iCAR) is a new wireless system architecture based on the integration of cellular and modern ad hoc relaying technologies. It addresses the congestion problem due to unbalanced traffic in a cellular system and provides interoperability for heterogeneous networks. The iCAR system can efficiently balance traffic loads between cells by using ad hoc relaying stations (ARS) to relay traffic from one cell to another dynamically. This not only increases the system's capacity cost effectively, but also reduces transmission power for mobile hosts and extends system coverage. In this paper, we compare the performance of the iCAR system with conventional cellular systems in terms of the call blocking/dropping probability, throughput, and signaling overhead via analysis and simulation. Our results show that with a limited number of ARSs and some increase in the signaling overhead (as well as hardware complexity), the call blocking/dropping probability in a congested cell and the overall system can be reduced.
An Efficient Distributed Network-Wide Broadcast Algorithm for Mobile Ad Hoc Networks
, 2001
"... In this paper, an algorithm for efficient network-wide broadcast (NWB) in mobile ad hoc networkds (MANETs) is proposed. The algorithm is performed in an asynchronous and distributed manner by each network node. The algorithm requires only limited topology knowledge, and therefore, is suitable for re ..."
Abstract
-
Cited by 61 (1 self)
- Add to MetaCart
In this paper, an algorithm for efficient network-wide broadcast (NWB) in mobile ad hoc networkds (MANETs) is proposed. The algorithm is performed in an asynchronous and distributed manner by each network node. The algorithm requires only limited topology knowledge, and therefore, is suitable for reactive MANET routing protocols. Simulations show that the proposed algorithm is on average 3-4 times as efficient as brute force flooding. Further, simulations show that the proposed algorithm compares favorably over a wide range of network sizes, with a greedy algorithm using global topology knowledge, in terms of minimizing packet transmissions. The application of the algorithm to route discovery in on-demand routing protocols is discussed in detail. Proofs of the algorithm's reliability and of the intracatability of solving for a minimum sized transmitter set to perform NWB are also given. I. INTRODUCTION Network-wide broadcast (NWB) is an essential feature of some of the emerging on-de...
Fisheye State Routing in Mobile Ad Hoc Networks
- In ICDCS Workshop on Wireless Networks and Mobile Computing
, 2000
"... In this paper, we present a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which de ..."
Abstract
-
Cited by 59 (5 self)
- Add to MetaCart
In this paper, we present a novel routing protocol for wireless ad hoc networks -- Fisheye State Routing (FSR). FSR introduces the notion of multi-level fisheye scope to reduce routing update overhead in large networks. Nodes exchange link state entries with their neighbors with a frequency which depends on distance to destination. From link state entries, nodes construct the topology map of the entire network and compute optimal routes. Simulation experiments show that FSR is simple, efficient and scalable routing solution in a mobile, ad hoc environment. 1 Introduction As the wireless and embedded computing technologies continue to advance, increasing numbers of small size and high performance computing and communication devices will be capable of tetherless communications and ad hoc wireless networking. An ad hoc wireless network is a selforganizing and self-configuring network with the capability of rapid deployment in response to application needs. An important characteristic wh...
Landmark Routing for Large Ad Hoc Wireless Networks
, 2000
"... In this paper, we present an enhanced version of the routing protocol Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR) and Landmark routing. The enhanced version features landmark election to cope with the dynamic and mobile environment. Other advantages ..."
Abstract
-
Cited by 46 (9 self)
- Add to MetaCart
In this paper, we present an enhanced version of the routing protocol Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR) and Landmark routing. The enhanced version features landmark election to cope with the dynamic and mobile environment. Other advantages of LANMAR include the use of landmarks for each logical group (e.g., a team of co-workers at a convention or a tank battalion in the battlefield) in order to reduce routing update overhead in large networks, and the exchanging of neighborhood link state only with neighbors. When network size grows, remote groups of nodes are "summarized" by the corresponding landmarks. As a result, each node will maintain accurate routing information about immediate neighborhood; at the same time it will keep track of the routing directions to the landmark nodes and thus, to remote groups. Simulation experiments show that the enhanced version suffers some performance degradation at steady state because of election overhead. However, it still provides an efficient and scalable routing solution in a mobile, ad hoc environment. Moreover, the election provides a much needed recovery from landmark failures.
Depth first search and location based localized routing and QoS routing in wireless networks
, 2000
"... In a localized routing algorithm, node A currently holding the message forwards it to one or few neighbors based on the location of itself, its neighboring nodes and destination. Several localized routing algorithms for wireless networks were described recently, based on location information of node ..."
Abstract
-
Cited by 42 (11 self)
- Add to MetaCart
In a localized routing algorithm, node A currently holding the message forwards it to one or few neighbors based on the location of itself, its neighboring nodes and destination. Several localized routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). The quality-of-service (QoS) routing (routing with delay and bandwidth constraints) in wireless networks is difficult because the network topology may change constantly, and all existing solutions are non-localized. We propose to use depth first search (DFS) method for routing decisions. Each node A, upon receiving the message for the first time, sorts all its neighbors according to a criteria, such as their distance to destination, and uses that order in DFS algorithm. The algorithm requires to memorize some of the past traffic at each node (as enforced by DFS). It is the first localized algorithm that guarantees delivery for (connected) wire...
BLR: Beacon-Less Routing Algorithm for Mobile Ad-Hoc Networks
- Elsevier’s Computer Communications Journal (Special Issue
, 2003
"... Routing of packets in a mobile ad-hoc network with a large number... this paper is a routing protocol that makes use of location information to reduce routing overhead. However, unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast Hello-messages (called ..."
Abstract
-
Cited by 41 (8 self)
- Add to MetaCart
Routing of packets in a mobile ad-hoc network with a large number... this paper is a routing protocol that makes use of location information to reduce routing overhead. However, unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast Hello-messages (called beaconing), and thus avoids drawbacks such as extensive use of scarce battery-power, interferences with regular data transmission, and performance degradation. BLR selects a forwarding node in a distributed manner among all its neighboring nodes with having information neither about their positions nor even about their existence. Data packets are broadcasted and the protocol takes care that just one of the receiving nodes forwards the packet. Optimized forwarding is achieved by applying a concept of Dynamic Forwarding Delay (DFD). Consequently, the node which computes the shortest forwarding delay relays the packet first. This forwarding is detected by the other nodes and suppresses them to relay the same packet any further. Analytical results and simulation experiments indicate that BLR provides efficient and robust routing in highly dynamic mobile ad-hoc networks.

