In addition to the ever growing host population, multiple other factors have contributed to the rapid growth of the global Internet routing table, such as policy routing, multihoming, and traffic steering. In this paper we first sort the routing table entries into two broad classes, covering prefixes which represent IP address blocks that do not overlap, either partially or completely, with the...

One of the most current routing families in wireless sensor networks is geographic routing. Using nodes location, they generally apply a greedy routing that makes a sensor forward data to route to one of its neighbors in the forwarding direction of the destination. If this greedy step fails, the routing protocol triggers a recovery mechanism. Such recovery mechanisms are mainly based on graph p...

Distributed Hash Tables (DHTs) support a hash-table-like lookup interface: given a key, it maps the key onto a node. One of the crucial questions facing DHTs is whether lookups can route correctly in a dynamic environment where the routing state is inconsistent. The routing state may become inconsistent when a node falsely thinks a failed neighbor is up (false negative), when a node falsely rem...

Wireless Sensor Networks (WSN) have revolutionized the processes involved in industrial communication. However, most important challenge faced by WSN sensors is presence of limited energy. Multiple research investigations been conducted so far on how to prolong energy WSN. This phenomenon a result inability network battery powered-sensor terminal. Energy-efficient routing packet flow parallel d...

Stateless greedy forwarding based on physical positions of nodes is considered to be more scalable than conventional topology-based routing. However, the stateless nature of geographic forwarding also prevents it from predicting holes in node distribution. Thus, frequent topology holes can significantly degrade the performance of geographic forwarding. So far the approaches mostly depend on exc...

One of the most important and challenging issues in real-time applications of resource-constrained wireless sensor networks (WSNs) is providing end-to-end delay requirement. To address such an issue a few QoS routing protocols have been proposed. THVR (Two-Hop Velocity based routing protocol) is newly proposed real-time protocol while it is based on the concept of using two-hop neighbor informa...

Lifetime optimization and security are two important design issues for WSNs with nonreplenishable energy resources. Routing protocols in wireless sensor networks (WSNs) are susceptible to a number of attacks depending on the nature of the protocol, its application, and the environment in which the protocol is intended to be used. Routing protocols that do not take the malicious attacks into acc...

As more and more real wireless sensor networks (WSN) applications have been tested and deployed recently, the research community realizes that several issues need to be revisited from practical angles. In this paper, we focus on designing a general energy-efficient, load balanced, fault-tolerant, and scalable routing protocol. First, we abstract four fundamental requirements of any practical ro...

Geographic routing provides for network scalability through routing decisions made from local position information. This feature is essentially at the cost of routing path stretch particularly in networks having sparse nodes or holes. To mitigate the unappealing factor, we exploit information on the maximum angle between successive edges from a node, defined as the representative angle of a nod...