GPS-free positioning in mobile ad-hoc networks

Čapkun, Srđjan; Hamdi, Maher; Hubaux, Jean-Pierre

doi:10.1109/hicss.2001.927202

Cited by 713 publications

(520 citation statements)

References 8 publications

Supporting

Mentioning

518

Contrasting

Unclassified

Order By: Relevance

“…However, it is promising that multi-hop information can lead to better performance in many aspects including routing, message broadcasting and channel access scheduling [7], [13]- [15]. Details of several distributed information exchange schemes and efficient algorithms in computing 2-hop neighborhood information for wireless ad hoc and sensor networks can be found in [16]- [18]. In a network of n nodes, a complexity analysis is reported in [19] that every node can obtain the knowledge of 2-hop neighborhood by a total of O(n) messages, each of O(log n) bits.…”

Section: Related Workmentioning

confidence: 99%

An exploration of geographic routing with k-hop based searching in wireless sensor networks

Chen

Song

2008

2008 Third International Conference on Communications and Networking in China

View full text Add to dashboard Cite

Abstract-We explore the asymptotic performance of existing geographic routing with a utilization of k-hop neighborhood information. The reachability from source to sink improves as we use more information for routing decision and the average number of hops required decreases significantly from 1-hop to 2-hop searching, which indicates a potential tradeoff between performance enhancement and system complexity. As simple greedy geographic routing is insufficient in lossy wireless environment, we propose a new metric incorporating both advance in distance and link quality. Through simulations, we show its effectiveness over the conventional simple greedy method. The generalization to k-hop based routing and resulting performance are also presented. Simulation results show that with the multi-hop based searching, there is a good improvement in the number of transmissions required from source to sink, which also indicates potential improvement in routing delay and energy consumption in transmissions.

show abstract

Section: Related Workmentioning

confidence: 99%

An exploration of geographic routing with k-hop based searching in wireless sensor networks

Chen

Song

2008

2008 Third International Conference on Communications and Networking in China

View full text Add to dashboard Cite

show abstract

“…Many of the above issues (eg, location determination without GPS, Geo Location server, perimeter routing to circumvent local maxima) have already been studied extensively in the literature [15,16,17] and will not be addressed here. However, previous studies were mostly based on UDP and lightly loaded networks.…”

Section: Airborne Swarmsmentioning

confidence: 99%

TCP over Geo-routing for High Mobility: Vehicle Grids and Airborne Swarms

2006

View full text Add to dashboard Cite

Summary. Ad hoc wireless networks have become the architecture of choice for peer to peer communications in areas where the telecommunications infrastructure is inadequate or has failed, A major challenge is the reliable delivery of data when nodes move. The reliable Internet protocol is TCP. However, TCP performs poorly in mobile ad hoc networks, mainly because of route breakage. To overcome this problem, a robust routing protocol must be used. To this effect, Geo-routing has recently received attention in large scale, mobile systems as it does not require endto-end path establishment and pre-computed packet forwarding routing structure at nodes. These properties make Geo-routing robust to highly dynamic route changes. For best performance, however, several parameters must be carefully tuned.In this paper we study the joint optimization of TCP and Geo-routing parameters to handle high speeds. We first introduce two highly mobile ad hoc scenarios that require reliable delivery, namely the vehicle urban grid and the airborne swarms. Then, we study the impact of critical system parameters (e.g., hello message exchange rate, delay timer in TCP for out-of-order delivery, etc) on the performance of both UDP and TCP. We improve hello message efficiency in Geo-routing by using an adaptive hello exchange scheme. Then, we fix the out-of-order problem in TCP by using a receiver-side out-of-order detection and delayed ack strategy. We show that these parameter adjustments are critical for efficient TCP over Geo-routing in highly mobile applications. With these enhancements our TCP with Geo-routing solution easily outperforms TCP over traditional ad hoc routing schemes, such as AODV.

show abstract

“…Semantic locations are obtained by mapping low-level hardware observables to semantic identifiers. The framework is modular to allow the use of different low-level localization techniques [5,10]. Our current implementation uses a combination of 802.11 scene analysis [1] and attenuation monitoring.…”

Section: The Panoply Middlewarementioning

confidence: 99%

nan0sphere: Location-Driven Fiction for Groups of Users

Eustice

Venkatraman

Walker

et al. 2007

Human-Computer Interaction. HCI Intelligent Multimodal Interaction Environments

View full text Add to dashboard Cite

Abstract. We developed a locative fiction application called nan0sphere and deployed it on the UCLA campus. This application presents an interactive narrative to users working in a group as they move around the campus. Based on each user's current location, previously visited locations, actions taken, and on the similar attributes of other users in the same group, the story will develop in different ways. Group members are encouraged by the story to move independently, with their individual actions and progress affecting the narrative and the overall group experience. Eight different locations on campus are involved in this story. Groups consist of four participants, and the complete story unfolds through the actions of all four group members. The supporting system could be used to create other similar types of locative literature, possibly augmented with multimedia, for other purposes and in other locations. We will discuss benefits and challenges of group interactions in locative fiction, infrastructure required to support such applications, issues of determining user locations, and our experiences using the application.

show abstract

GPS-free positioning in mobile ad-hoc networks

Abstract: In this paper we consider the problem of node positioning in ad-hoc

Cited by 713 publications

References 8 publications

An exploration of geographic routing with k-hop based searching in wireless sensor networks

An exploration of geographic routing with k-hop based searching in wireless sensor networks

TCP over Geo-routing for High Mobility: Vehicle Grids and Airborne Swarms

nan0sphere: Location-Driven Fiction for Groups of Users

Contact Info

Product

Resources

About