An Off-line Algorithm to Estimate Trajectories of Mobile Nodes Using Ad-hoc Communication (concise contribution)

Fujii, Sae; Uchiyama, Akira; Umedu, Takaaki; Yamaguchi, Hirozumi; Higashino, Teruo

doi:10.1109/percom.2008.112

Cited by 13 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly, DWMDS (Dynamic Weighted MDS) [9] uses movement constraints in addition to the connectivity information, and estimates the trajectories of mobile nodes. TRACKIE [10] first estimates mobile nodes that were likely to move between landmarks straight. Based on their estimated trajectories, it estimates the trajectories of the other nodes.…”

Section: Related Workmentioning

confidence: 99%

Trusted Destination Sequenced Distance Vector Routing Protocol for Mobile Ad-hoc Network

Arif¹,

Shrivastav²

2012

IJCA

View full text Add to dashboard Cite

A Mobile Ad hoc Network (MANET) is a self-organized system comprised of mobile wireless nodes with peer relationships. MANETs can operate without fixed infrastructure and can survive rapid changes in the network topology. Due to multi-hop routing and absence of any trusted third party in open environment, MANETs are vulnerable to attacks by malicious nodes or unwanted packet forwarding through UDSDV (Un-trust Destination Sequence distance vector routing). In order to decrease the unwanted data flooding and routing misbehaviour from malicious nodes or UDSDV node, we introduce the concept of trust based destination sequence distance vector routing that is TDSDV module, if we apply TDSDV routing and same time UDSDV node presence in the network so TDSDV node protect through unwanted packet flooding of the network and increases network performance. In this paper we proposed TDSDV trust based destination sequence distance vector routing and analyze the behaviour on the network parameter like throughput, packet delivery ratio, end-to-end delay, routing overhead and energy consume via mobile nodes in all three cases DSDV, UDSDV and TDSDV routing.

show abstract

Section: Related Workmentioning

confidence: 99%

Trusted Destination Sequenced Distance Vector Routing Protocol for Mobile Ad-hoc Network

Arif¹,

Shrivastav²

2012

IJCA

View full text Add to dashboard Cite

show abstract

“…Similarly, DWMDS (Dynamic Weighted MDS) [14] uses movement constraints in addition to the connectivity information, and estimates the trajectories of mobile nodes. TRACKIE [2] first estimates mobile nodes that were likely to move between landmarks straight. Based on their estimated trajectories, it estimates the trajectories of the other nodes.…”

Section: Related Workmentioning

confidence: 99%

Secured Distance Vector Routing 'SDVR' Protocol for Mobile Adhoc Networks

Baboo¹,

Ramesh²

2011

IJCA

View full text Add to dashboard Cite

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes dynamically shaping a provisional network devoid of the use of any existing network infrastructure or centralized management. In MANETs, security is the major challenge due to the dynamic topology which is because of the mobility of the nodes. In this paper, we propose to design and develop a secure methodology incorporated with the routing mechanism without having any compromise on the performance metrics viz., throughput, and packet delivery fraction. Not only just improving the throughput and packet delivery fraction it will also reduce the end-to-end delay and MAC overhead along with reduced packet loss. We name it as Secured Distance Vector Routing (SDVR) protocol. It adopts several features of the already existing protocol named Ad-hoc On-demand Distance Vector Routing (AODV). The simulation results prove that our proposed protocol SDVR outperforms AODV in all performance aspects..

show abstract

“…We evaluated three algorithms (namely, Amorphous, MCL, MobiAmorph) under both street area and open area scenarios. The street scenario is a 500m x 500m city area with buildings from TRACKIE [14] as in Figure 3(a), and the open area scenario is a 100m x 100m square as in Figure 3(b). The gray shapes are buildings, green dots are non-seed users (nodes), and red dots are GPS-enabled (seeds) users.…”

Section: Performance Comparison With Other Existing Algorithmsmentioning

confidence: 99%

GPS Calibrated Ad-Hoc Localization for Geosocial Networking

Wang

2010

Ubiquitous Intelligence and Computing

View full text Add to dashboard Cite

Cost-effective localization for large-scale Geosocial networking service is a challenging issue in urban environment. This paper studies an ad-hoc localization technique which takes advantages of short-range interchanged location information for calibrating the location of mobile users carrying non-GPS mobile phones. We demonstrate by simulation that a small percentage of GPS-enabled mobile phones can greatly enable the localization of other non-GPS pedestrians in the urban environment. Based on the proposed localization technique, we implement a location-aware social networking tool called Mobile Twitter, similar to the microblogging service of Twitter, for fast propagation of social events happening in surroundings. Evaluation shows the our localization algorithm can achieve better accuracy of the location estimation and wider coverage as compared with the Amorphous algorithm and the Monte Carlo Localization (MCL) method. Moreover, we show that the Mobile Twitter implemented on an Android mobile phone is power-efficient in real-life usage scenarios.

show abstract

An Off-line Algorithm to Estimate Trajectories of Mobile Nodes Using Ad-hoc Communication (concise contribution)

Cited by 13 publications

References 14 publications

Trusted Destination Sequenced Distance Vector Routing Protocol for Mobile Ad-hoc Network

Trusted Destination Sequenced Distance Vector Routing Protocol for Mobile Ad-hoc Network

Secured Distance Vector Routing 'SDVR' Protocol for Mobile Adhoc Networks

GPS Calibrated Ad-Hoc Localization for Geosocial Networking

Contact Info

Product

Resources

About