—We propose a generic routing table design principle for scalable routing on networks with bounded geometric growth. Given an inaccurate distance oracle that estimates the graph ...
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
Abstract—In ad hoc position-location networks, location information is obtained through the sequential estimation of node locations. An unlocalized node can estimate its location...
The Sensor Internet provides access to sensor services by connecting sensor nodes to the Internet infrastructure. To achieve this, current solutions rely on fixed access points or ...
Frank Siegemund, Muhammad Haroon, Junaid Ansari, P...