Challenge of efficient protocol design for energy constrained wireless sensor networks is addressed through application specific cross-layer designs.This design approach alongwith strong design assumptions limits application of protocols in universal scenarios and affects their practicality. With proliferation of embedded mobile sensors in consumer devices, a changed application paradigm requir...

In this paper, we extend our early work on safety information in wireless ad hoc sensor networks to the realistic communication model in which each node has the opportunity to receive the signal from any node in the entire network. The safety information is a value ∈ [0, 1] at each node which is calculated in a fully distributed manner based on 1-hop neighborhood information. It indicates the m...

In this paper we propose a new scheduling algorithm called Real Time Scheduling (RTS) which uses virtual nodes for self stabilization. This algorithm deals with all the contributing components of the end-to-end travelling delay of data packets in sensor network and with virtual nodes algorithm achieves QoS in terms of packet delivery, multiple connections, better power management and stable rou...

This paper first envisions the advent of the directional wireless mesh networks with multiple radios and directional antennas in the coming years. Then, based on the observation that simplicity induces efficiency and scalability, the paper proposes a combined geometric deployment and routing strategy for such mesh networks, and also gives a concrete approach under this strategy. The main idea o...

The algorithmic small-world phenomenon, empirically established by Milgram’s letter forwarding experiments from the 60s [47], was theoretically explained by Kleinberg in 2000 [36]. However, from today’s perspective his model has several severe shortcomings that limit the applicability to real-world networks. In order to give a more convincing explanation of the algorithmic small-world phenomeno...

Social network influence dissemination focuses on employing a small number of seed sets to generate the most significant possible in social networks and considers forwarding be only technique information transmission, ignoring all other ways. Users, for example, can post message via this mode distribution (called para), which is difficult trace, posing danger privacy leakage. This research trie...

Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy routing algorithms might fail even if there is a path from source to destination. In recent years several recovery strategies have been proposed in order to overcome such greedy routing failures. Planar graph traversal wa...

The greedy strategy of geographical routing may cause the local minimum problem when there is a hole in the routing area. It depends on other strategies such as perimeter routing to find a detour path, which can be long and result in inefficiency of the routing protocol. In this paper, we propose a new approach called Intermediate Target based Geographic Routing (ITGR) to solve the long detour ...

Multi-hop ad-hoc networks consist of nodes which cooperate by forwarding packets for each other to allow communication beyond the power range of each node. In pure ad-hoc networks, no additional infrastructure is required to allow the nodes to communicate. Multi-hop hybrid networks are a combination of ad-hoc and cellular networks. As in ad-hoc networks, the nodes forward packets on behalf of o...

Existing position-based routing algorithms, where packets are forwarded in the geographic direction of the destination, normally require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is gained by observing beacon messages that each node sends out periodically. Several beaconless greedy routing schemes have been prop...