Related papers: Hierarchical Bipartition Routing for delivery guar…
Routing is one of the critical and ongoing challenges in Wireless Sensor Networks. The main challenge has always been to have a routing protocol that reduces the communication overhead, hence saving the energy of the sensors in the network.…
A wireless sensor network consists of light-weight, low power, small size sensor nodes. Routing in wireless sensor networks is a demanding task. This demand has led to a number of routing protocols which efficiently utilize the limited…
As an increasing amount of research is being done on various applications of sensor networks in adversarial environments, ensuring secure routing becomes of critical importance for the success of such deployments. The problem of designing a…
Geographic routing is becoming the protocol of choice for many sensor network applications. The current state of the art is unsatisfactory: some algorithms are very efficient, however they require a preliminary planarization of the…
Wireless Sensor Networks is important to nodes energy consumption for long activity of sensor nodes because nodes that compose sensor network are small size, and battery capacity is limited. For energy consumption decrease of sensor nodes,…
The paper presents two mechanisms for designing an on-demand, reliable and efficient collection protocol for Wireless Sensor Networks. The former is the Bidirectional Link Quality Estimation, which allows nodes to easily and quickly compute…
Hierarchical ring networks, which hierarchically connect multiple levels of rings, have been proposed in the past to improve the scalability of ring interconnects, but past hierarchical ring designs sacrifice some of the key benefits of…
Wireless Sensor Networks (WSNs) experiences several technical challenges such as limited energy, short transmission range, limited storage capacities, and limited computational capabilities. Moreover, the sensor nodes are deployed randomly…
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only. To efficiently construct a…
Geographic routing offers guaranteed packet deliv- ery in a dense network. In this routing, packets are forwarded to a node which is nearer to the destination with an extensive use of location information. However, research studies in…
This paper addresses the problem of reliable transmission of data through a sensor network. We focus on networks rapidly deployed in harsh environments. For these networks, important design requirements are fast data transmission and rapid…
We study the problem of power-efficient routing for multihop wireless ad hoc sensor networks. The guiding insight of our work is that unlike an ad hoc wireless network, a wireless ad hoc sensor network does not require full connectivity…
A main challenge of 5G and beyond wireless systems is to efficiently utilize the available spectrum and simultaneously reduce the energy consumption. From the radio resource allocation perspective, the solution to this problem is to…
Wireless sensor networks are collections of large number of sensor nodes. The sensor nodes are featured with limited energy, computation and transmission power. Each node in the network coordinates with every other node in forwarding their…
Random basketball routing (BR) \cite {Hwang} is a simple protocol that integrates MAC and multihop routing in a cross-layer optimized manner. Due to its lightness and performance, BR would be quite suitable for sensor networks, where…
The sensor nodes in a Wireless Sensor Network are generally constrained with limited power supply. Efficient power management is a must for any sensor network to keep the sensor nodes in the network to be operational for a longer period of…
We introduce hierarchical neighbor graphs, a new architecture for connecting ad hoc wireless nodes distributed in a plane. The structure has the flavor of hierarchical clustering and requires only local knowledge and minimal computation at…
We consider a general class of low complexity distributed scheduling algorithms in wireless networks, maximal scheduling with priorities, where a maximal set of transmitting links in each time slot are selected according to certain…
This paper introduces a traffic engineering routing algorithm that aims to accept as many routing demands as possible on the condition that a certain amount of bandwidth resource is reserved for each accepted demand. The novel idea is to…
Wireless Sensor Networks (WSNs) are often deployed in hostile environments, which make such networks highly vulnerable and increase the risk of attacks against this type of network. WSN comprise of large number of sensor nodes with…