The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks

@article{Jeng2007TheRG,
  title={The r-Neighborhood Graph: An Adjustable Structure for Topology Control in Wireless Ad Hoc Networks},
  author={Andy An-Kai Jeng and Rong-Hong Jan},
  journal={IEEE Transactions on Parallel and Distributed Systems},
  year={2007},
  volume={18}
}
In wireless ad hoc networks, constructing and maintaining a topology with lower node degrees is usually intended to mitigate excessive traffic load on wireless nodes. However, keeping lower node degrees often prevents nodes from choosing better routes that consume less energy. Therefore, the trade-off is between the node degree and the energy efficiency. In this paper, an adjustable structure, named the r-neighborhood graph, is proposed to control the topology. This structure has the… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
19 Citations
29 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 19 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Similar Papers

Loading similar papers…