Results 1 - 10
of
15
Facilitating Real-time Applications in VANETs through Fast Address Auto-configuration
- in Proc. of the 3rd IEEE CCNC International Workshop on Networking Issues in Multimedia Entertainment (CCNC/NIME 2007), Las Vegas, NV, USA, IEEE Communications Society
, 2007
"... Abstract — Real-time applications are going to play a major role in Vehicular Ad-hoc Networks (VANETs). In this context, nodes ’ IP addresses need to be automatically configured in a very small time and with a reduced need for re-configurations. Due to the very high mobility of vehicles, however, tr ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
(Show Context)
Abstract — Real-time applications are going to play a major role in Vehicular Ad-hoc Networks (VANETs). In this context, nodes ’ IP addresses need to be automatically configured in a very small time and with a reduced need for re-configurations. Due to the very high mobility of vehicles, however, traditional mechanisms for address auto-configuration fail to perform well. Aimed at solving this problem, we propose a novel Leader-based scheme that exploits the topology of VANETs and a distributed DHCP service to guarantee fast and stable address configuration. Keywords: Ad-hoc networks, VANET, address configuration. I.
Vehicular Address Configuration
- in Proc. of the 1st IEEE Workshop on Automotive Networking and Applications (AutoNet), GLOBECOM 2006
, 2006
"... Vehicular networks are characterized by unique properties and challenging problems. The high mobility and density of nodes impede the direct utilization of traditional techniques and protocols in this context. In particular, automatic IP address configuration in vehicular ad-hoc networks is a challe ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
Vehicular networks are characterized by unique properties and challenging problems. The high mobility and density of nodes impede the direct utilization of traditional techniques and protocols in this context. In particular, automatic IP address configuration in vehicular ad-hoc networks is a challenging and as yet unexplored issue. The importance of this problem cannot be overemphasized since any application that involves communication between two or more nodes requires the presence of unique identifiers to deliver the data to the right destination. Due to the very high mobility of vehicles, traditional mechanisms to automatically associate an IP address to a wireless node fail to perform well. To solve this problem, we propose a novel scheme that exploits the topology of vehicular ad-hoc networks and an enhanced DHCP service with dynamically elected leaders to guarantee reliable and fast address configuration. We provide extensive simulation results that demonstrate the efficacy of our scheme. Keywords: Ad-hoc networks, VANET, address configuration. I.
Modeling and Performance Analysis of Address Allocation Schemes for Mobile Ad Hoc Networks
- IEEE Trans. Veh. Technol
"... Abstract—Address allocation is an essential part in maintaining a mobile ad hoc network (MANET) effectively, and several address allocation schemes have been proposed. In this paper, we present a set of analytical models to evaluate the efficiency of address allocation schemes. The derived models qu ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
Abstract—Address allocation is an essential part in maintaining a mobile ad hoc network (MANET) effectively, and several address allocation schemes have been proposed. In this paper, we present a set of analytical models to evaluate the efficiency of address allocation schemes. The derived models quantitatively characterize the efficiency of four popular address allocation schemes in terms of latency and communication overhead. Through the analysis, we achieve numerical results that show the impact of network parameters on the efficiency of these schemes. We also conduct simulations and compare with analytical results to validate our models. The analytical model developed in this paper is able to more accurately predict the performance of address allocation schemes over a various range of loss rates and would be useful in providing more insights for the study of an efficient address allocation scheme in MANETs. To our understanding, this is the first attempt in mathematically investigating the performance of addressing schemes in ad hoc networks. Index Terms—Dynamic addressing scheme, mobile ad hoc network (MANET), performance analysis. I.
On Demand Label Switching for Spontaneous Edge Networks
- In Proceedings of ACM Sigcomm Workshop in Future Directions in Network Architecture
, 2004
"... We consider the problem of interconnecting hosts in spontaneous edge networks composed of various types of wired or wireless physical and link layer technologies. All or some hosts in a spontaneous network can be organized as a multihop ad hoc network, connected or not to the global Internet. We arg ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
(Show Context)
We consider the problem of interconnecting hosts in spontaneous edge networks composed of various types of wired or wireless physical and link layer technologies. All or some hosts in a spontaneous network can be organized as a multihop ad hoc network, connected or not to the global Internet. We argue that this kind of networks requires a more sophisticated approach than standard IP forwarding: communication paths should be managed on a per flow basis, multiple paths need to be maintained to cope with link failures or changing topologies, and the interconnection architecture should provide information on destination reachability. We have designed and implemented Lilith, a prototype of an interconnection node for spontaneous edge networks. We handle network dynamics by establishing MPLS (Multi Protocol Label Switching) label switched paths (LSP) on demand with a reactive ad hoc routing protocol. Interconnection at layer 2.5 makes all the hosts to appear as one single IP subnet so that configuration protocols can use the subnet broadcast for all forms of discovery (addresses, names, services). Performance measurements of the Lilith implementation on Linux show good performance compared with standard IP forwarding and important performance gains when multiple paths are used.
Abstract
"... In this paper we present a survey of secure ad hoc routing protocols for mobile wireless networks. A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate ..."
Abstract
- Add to MetaCart
(Show Context)
In this paper we present a survey of secure ad hoc routing protocols for mobile wireless networks. A mobile ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. The widely accepted existing routing protocols designed to accommodate the needs of such self-organized networks do not address possible threats aiming at the disruption of the protocol itself. The assumption of a trusted environment is not one that can be realistically expected; hence several efforts have been made towards the design of a secure and robust routing protocol for ad hoc networks. We briefly present the most popular protocols that follow the table-driven and the source-initiated on-demand approaches. Based on this discussion we then formulate the threat model for ad hoc routing and present several specific attacks that can target the operation of a protocol. In order to analyze the proposed secure ad hoc routing protocols in a structured way we have classified them into five categories; solutions based on asymmetric cryptography, solutions based on symmetric cryptography, hybrid solutions, reputation-based solutions and a category of add-on mechanisms that satisfy specific security requirements. A comparison between these solutions can provide the basis for future research in this rapidly evolving area. 1
Advanced Disjoint Address Allocation for Mobile
"... Abstract—Regarding to address allocation, a mobile ad hoc network (MANET) may suffer from the lack of address and network partition/merging due to mobility of nodes. In this paper, we propose a new address allocation protocol for dealing with those problems. The proposed protocol is developed based ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—Regarding to address allocation, a mobile ad hoc network (MANET) may suffer from the lack of address and network partition/merging due to mobility of nodes. In this paper, we propose a new address allocation protocol for dealing with those problems. The proposed protocol is developed based on disjoint address set distribution with binary splitting for scalability, and provides special treatments for resolving the lack of addresses. We also present an effective technique for handling network partition and merging. Through simulation, we show that the proposed protocol is effective to allocate addresses in a MANET with reasonable latency and communication overhead. I.
Lazy Autoconfiguration in Mobile Ad Hoc Networks And Dynamic . . .
, 2006
"... In MANETs and similar link-free networks of communicating objects there is no central authority for naming and connection management. Autoconfiguration of network nodes is therefore desirable and, building on approaches in IPv6, a number of `zero configuration' networking protocols have been ..."
Abstract
- Add to MetaCart
In MANETs and similar link-free networks of communicating objects there is no central authority for naming and connection management. Autoconfiguration of network nodes is therefore desirable and, building on approaches in IPv6, a number of `zero configuration' networking protocols have been proposed for this case. Typically these protocols do not easily scale and have di#culty with network partitioning and merging. In this paper we propose a number of novel, decentralized techniques for name resolution in zero configuration protocols that are more flexible and yet lead to name extensions of smallest possible length, assuming that objects su#ciently mix within their ranges. Finally, the techniques are converted into a fully decentralized, scalable autoconfiguration protocol for use in ad hoc networks with directional antennas. The protocol is `lazy' in the sense that name resolution is postponed until the moment that conflicts prevent the correct functioning of the communication structure.
Dynamic address allocation for self-organised management and control in sensor networks
, 2007
"... Several data-centric communication paradigms have been proposed in the domain of Wireless Sensor Networks (WSN). Therefore, the principles of operation and maintenance in such networks are changing to control massively distributed systems. Previous addressing schemes fail or produce too much overhea ..."
Abstract
- Add to MetaCart
Several data-centric communication paradigms have been proposed in the domain of Wireless Sensor Networks (WSN). Therefore, the principles of operation and maintenance in such networks are changing to control massively distributed systems. Previous addressing schemes fail or produce too much overhead if only locally unique addresses of sensor nodes are required. In this paper, we present a dynamic address allocation scheme for localised address assignments in WSN. We developed a round-based address assignment with subsequent duplicate address detection that operates in a self-organised manner. It inherently allows busy-sleep periods and does not assume always awake nodes. To verify the approach, we implemented the algorithm on Mica2 sensor motes and tested it in a WSN maintenance scenario. The results demonstrate that our method works well for operation and maintenance of WSN without prior address assignments.
A Heuristic Routing Mechanism Using a New Addressing Scheme
"... Abstract-Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network changes. Despite the variability of data in routing tables, node addresses are constant. In this paper, we first ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract-Current methods of routing are based on network information in the form of routing tables, in which routing protocols determine how to update the tables according to the network changes. Despite the variability of data in routing tables, node addresses are constant. In this paper, we first introduce the new concept of variable addresses, which results in a novel framework to cope with routing problems using heuristic solutions. Then we propose a heuristic routing mechanism based on the application of genes for determination of network addresses in a variable address network and describe how this method flexibly solves different problems and induces new ideas in providing integral solutions for variety of problems. The case of ad-hoc networks is where simulation results are more supportive and original solutions have been proposed for issues like mobility.
