Discovering timely information in MANETs

Authors:
De-Kai Liu;Chaiporn Jaikaeo;Chien-Chung Shen;Ren-Hung Hwang
Affiliations:
Computer Science and Information Engineering, National Chung Cheng University, Taiwan;Computer Engineering, Kasetsart University, Thailand;Computer and Information Sciences, University of Delaware, USA;Computer Science and Information Engineering, National Chung Cheng University, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 3
Cited 0

Manycast: exploring the space between anycast and multicast in ad hoc networks

Proceedings of the 9th annual international conference on Mobile computing and networking
Mobility-assisted resolution of queries in large-scale mobile sensor networks (MARQ)

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Querying time indexed information in mobile Ad hoc networks

Ad Hoc Networks

Quantified Score

Hi-index	0.09

Visualization

Abstract

Timely information refers to information whose 'most recent' or 'latest' instance is most valuable. In mobile ad hoc networks (MANETs), multiple instances of a piece of timely information may be produced by different nodes at different points in time. The problem is to discover the 'latest' instance among all existing instances. Within the context of MANETs, timely information discovery is fundamentally different from the existing resource/service discovery problem whose goal is to discover either any instance or a subset of instances which satisfy a local query constraint that can be specified and evaluated using only local attributes of each individual node. In contrast, the timely information discovery problem imposes the global (timeliness) constraint which should best be evaluated when all the instances are considered to determine the latest instance. The complication of discovering timely information arises from the existence of multiple instances of the information, which are produced at different points in time by different nodes in the network, and the need to collect all these instances to decide the latest instance. For MANETs, the lack of infrastructure supports, frequent topology changes, and potential packet loss in wireless communications further challenge the problem of timely information discovery. This paper describes a self-organizing, peer-to-peer based approach, termed ALADIN, to discovering timely information in MANETs. In ALADIN, nodes that produce instances of the timely information are peers who self-organize an adaptive and distributed 'search infrastructure' to facilitate the discovery of the latest instance. A simulation study shows that ALADIN is scalable without incurring network-wide flooding in the case of large-scale networks and popular timely information, and yields a high chance of discovering the latest instance in the presence of mobility.