Marc Heissenbüttel

Bio: Marc Heissenbüttel is an academic researcher from University of Bern. The author has contributed to research in topics: Routing protocol & Wireless Routing Protocol. The author has an hindex of 7, co-authored 11 publications receiving 704 citations.

Ants-Based Routing in Large Scale Mobile Ad-Hoc Networks.

Abstract: In this paper, we address the problem of routing in large-scale mobile ad-hoc networks (MANETs), both in terms of number of nodes and coverage area. Our approach aims at abstracting from the dynamic, irregular topology of a MANET to obtain a topology with “logical routers” and “logical links”, where logical router and logical links are just a collection of nodes and (multihop) paths between them, respectively. To “build” these logical routers, nodes geographically close to each other are grouped together. Logical links are established between selected logical routers. On top of this abstract topology, we propose to run a routing protocol based on mobile agents and inspired from social insects behaviour.

Optimized Stateless Broadcasting in Wireless Multi-Hop Networks

Abstract: In this paper we present a simple and stateless broadcasting protocol called Dynamic Delayed Broadcasting (DDB) which allows locally optimal broadcasting without any prior knowledge of the neighborhood. As DDB does not require any transmissions of control messages, it conserves critical network resources such as battery power and bandwidth. Local optimality is achieved by applying a principle of Dynamic Forwarding Delay (DFD) which delays the transmissions dynamically and in a completely distributed way at the receiving nodes ensuring nodes with a higher probability to reach new nodes transmit first. An optimized performance of DDB over other stateless protocols is shown by analytical results. Furthermore, simulation results show that, unlike stateful broadcasting protocols, the performance of DDB does not suffer in dynamic topologies caused by mobility and sleep cycles of nodes. These results together with its simplicity and the conservation of network resources, as no control message transmissions are required, make DDB especially suited for sensor and vehicular ad-hoc networks.

Evaluating the limitations of and alternatives in beaconing

Abstract: In position-based routing protocols, each node periodically transmits a short hello message (called beacon) to announce its presence and position. Receiving nodes list all known neighbor nodes with their position in the neighbor table and remove entries after they have failed to receive a beacon for a certain time from the corresponding node. In highly dynamic networks, the information stored in the neighbor table is often outdated and does no longer reflect the actual topology of the network causing retransmissions and rerouting that consume bandwidth and increase latency. An analysis on the possible impact of beacons due outdated and inaccurate neighbor tables is needed. We quantify by analytical and simulation means the possible performance loss and explore the limitations of position-based routing protocols which use beaconing. In highly mobile ad-hoc networks, the delay can increase by a factor of 20. The neighbor table inaccuracy is the main source of packet loss in uncongested networks. We propose and evaluate several concrete mechanisms to improve the accuracy of neighborhood information, e.g., by dynamic adaptation of the timer values when beacons are broadcasted, and show their effectiveness by extensive simulation.

Performance of the beacon-less routing protocol in realistic scenarios

Abstract: The beacon-less routing protocol (BLR) is a position-based routing protocol for mobile ad-hoc networks that makes use of location information to reduce routing overhead. Unlike other position-based routing protocols, BLR does not require nodes to periodically broadcast hello messages. This avoids drawbacks such as extensive use of scarce battery-power, interferences with regular data transmission, and outdated position information in case of high mobility. This paper discusses the behavior and performance of BLR in realistic scenarios, in particular with irregular transmission ranges. BLR has been implemented using appropriate simulation models and in an out-door test-bed consisting of GNU/Linux laptops with wireless LAN network interfaces and GPS receivers.

VBF: vector-based forwarding protocol for underwater sensor networks

Abstract: In this paper, we tackle one fundamental problem in Underwater Sensor Networks (UWSNs): robust, scalable and energy efficient routing. UWSNs are significantly different from terrestrial sensor networks in the following aspects: low bandwidth, high latency, node float mobility (resulting in high network dynamics), high error probability, and 3-dimensional space. These new features bring many challenges to the network protocol design of UWSNs. In this paper, we propose a novel routing protocol, called vector-based forwarding (VBF), to provide robust, scalable and energy efficient routing. VBF is essentially a position-based routing approach: nodes close to the “vector” from the source to the destination will forward the message. In this way, only a small fraction of the nodes are involved in routing. VBF also adopts a localized and distributed self-adaptation algorithm which allows nodes to weigh the benefit of forwarding packets and thus reduce energy consumption by discarding the low benefit packets. Through simulation experiments, we show the promising performance of VBF.

AntHocNet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks

Abstract: In this paper, we describe AntHocNet, an algorithm for routing in mobile ad hoc networks. It is a hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. The algorithm is based on the nature-inspired ant colony optimisation framework. Paths are learned by guided Monte Carlo sampling using ant-like agents communicating in a stigmergic way. In an extensive set of simulation experiments, we compare AntHocNet with AODV, a reference algorithm in the field. We show that our algorithm can outperform AODV on different evaluation criteria. AntHocNet's performance advantage is visible over a broad range of possible network scenarios, and increases for larger, sparser and more mobile networks. Copyright © 2005 AEIT.

Information dissemination in self-organizing intervehicle networks

Abstract: Intervehicle communication (IVC) is an emerging topic in research and application that is getting increasing attention from all major car manufacturers. In this paper, a novel method for scalable information dissemination in highly mobile ad hoc networks is proposed: segment-oriented data abstraction and dissemination (SODAD). With SODAD, information can be distributed in an information range multiple orders of magnitude larger than the transmission range of the air interface, even if only 1%-3% of all vehicles are equipped with an IVC system, e.g., during market introduction. By restricting the method to the dissemination of map/position-based data, scalability is achieved. In the second half of this paper, an example application for the SODAD method is presented: a self-organizing traffic-information system (SOTIS). In SOTIS, a car is equipped with a satellite navigation receiver, an IVC system, and a digital map. Each individual vehicle collects traffic information for its local area. Using the digital map, the traffic information is analyzed based on road segments. By distributing the information in the ad hoc intervehicle network using the SODAD method, a decentralized traffic information system is created. The performance of the proposed methods is evaluated using network simulation with vehicular mobility models. Simulation results for typical scenarios are presented. Furthermore, a prototype implementation based on commercially available standard hardware demonstrates the feasibility of the proposed approach.