1970 search results - page 262 / 394 » Node Localisation in Wireless Ad Hoc Networks |
148
click to vote
SPAA
2003
ACM
15 years 9 months ago
2003
ACM
Link reversal algorithms provide a simple mechanism for routing in mobile ad hoc networks. These algorithms maintain routes to any particular destination in the network, even when...
141
click to vote
AINA
2007
IEEE
15 years 10 months ago
2007
IEEE
In recent years, several trust and reputation models have been proposed to enhance the security of mobile ad hoc networks. However, they either fail to capture evidence of trustwo...
129
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— Existing random mobility models have their limitations such as speed decay and sharp turn which have been demonstrated by the previous studies. More importantly, mobili...
170
click to vote
AINA
2005
IEEE
15 years 10 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
150
click to vote
WOWMOM
2005
ACM
15 years 10 months ago
2005
ACM
— In this paper, we propose three interdomain routing schemes for communications between different ad-hoc groups (subnets), namely the implicit foreign degree based (IFD), the ex...