Open Access
Using directionality in wireless routing
Bow-Nan Cheng
- 01 Jan 2008
TL;DR: In this paper, the authors present a survey of the state-of-the-art tools and techniques used in the development of the HOGA algorithm and its application in the field of artificial intelligence.
read more
Abstract: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvii
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
DART: A Directional Antenna Based RouTing Protocol for Ad-Hoc Networks with High Mobility
Tong Zhao,Jie Luo,Wei Yan,Xiaoming Li +3 more
- 01 Sep 2012
TL;DR: The proposed Directional Antenna based RouTing (DART) protocol that utilizes direction information to route packets is more robust to mobility than precise hop-by-hop path information, which makes DART suitable to highly dynamic scenarios.
2
Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks
Hasan Guclu,Murat Yuksel +1 more
- 01 Mar 2008
TL;DR: In this article, the authors investigate the effect of hard cutoffs on the search efficiency in unstructured peer-to-peer (P2P) networks and show that the efficiency of the flooding search reduces as the size of the hard cutoff does.
1
References
•Book
Wireless Communications: Principles and Practice
Theodore S. Rappaport
- 15 Jan 1996
TL;DR: WireWireless Communications: Principles and Practice, Second Edition is the definitive modern text for wireless communications technology and system design as discussed by the authors, which covers the fundamental issues impacting all wireless networks and reviews virtually every important new wireless standard and technological development, offering especially comprehensive coverage of the 3G systems and wireless local area networks (WLANs).
20K
Ad-hoc on-demand distance vector routing
C.E. Perkins,E.M. Royer +1 more
- 25 Feb 1999
TL;DR: An ad-hoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure and the proposed routing algorithm is quite suitable for a dynamic self starting network, as required by users wishing to utilize ad- hoc networks.
Chord: A scalable peer-to-peer lookup service for internet applications
Ion Stoica,Robert Morris,David R. Karger,M. Frans Kaashoek,Hari Balakrishnan +4 more
- 27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
11.2K
The capacity of wireless networks
Piyush Gupta,P. R. Kumar +1 more
TL;DR: When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits persecond under a noninterference protocol.
GPSR: greedy perimeter stateless routing for wireless networks
Brad Karp,Hsiang-Tsung Kung +1 more
- 01 Aug 2000
TL;DR: Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.