Wireless sensor networks (WSN) are characterized by a network of small, battery powered devices, operating remotely with no pre-existing infrastructure. The unique structure of WSN allow for novel approaches to data reduction and energy preservation. This paper presents a modification to the existing Q-routing protocol by providing an alternate action of performing sensor data reduction in place thereby reducing energy consumption, bandwidth usage, and message transmission time. The algorithm is further modified to include an energy factor which increases the cost of forwarding as energy reserves deplete. This encourages the network to conserve energy in favor of network preservation when energy reserves are low. Our experimental results show that this approach can, in periods of high network traffic, simultaneously reduce bandwidth, conserve energy, and maintain low message transition times.
In this paper, we study the joint computation offloading and resource allocation problem in the two-tier wireless heterogeneous network (HetNet). Our design aims to optimize the computation offloading to the cloud jointly with the subchannel allocation to minimize the maximum (min-max) weighted energy consumption subject to practical constraints on bandwidth, computing resource and allowable latency for the multi-user multitask computation system. To tackle this non-convex mixed integer non-linear problem (MINLP), we employ the bisection search method to solve it where we propose a novel appro…
With the rapid increase in demand for mobile data, mobile network operators are trying to expand wireless network capacity by deploying wireless local area network (LAN) hotspots on which they can offload their mobile traffic. However, these network-centric methods usually do not fulfill the interests of mobile users (MUs). Taking into consideration many issues, MUs should be able to decide whether to offload their traffic to a complementary wireless LAN. Our previous work studied single-flow wireless LAN offloading from a MU's perspective by considering delay-tolerance of traffic, monetary co…
Wireless powered mobile-edge computing (MEC) has recently emerged as a promising paradigm to enhance the data processing capability of low-power networks, such as wireless sensor networks and internet of things (IoT). In this paper, we consider a wireless powered MEC network that adopts a binary offloading policy, so that each computation task of wireless devices (WDs) is either executed locally or fully offloaded to an MEC server. Our goal is to acquire an online algorithm that optimally adapts task offloading decisions and wireless resource allocations to the time-varying wireless channel co…
Mobile edge computing (MEC) has attracted great interests as a promising approach to augment computational capabilities of mobile devices. An important issue in the MEC paradigm is computation offloading. In this paper, we propose an integrated framework for computation offloading and interference management in wireless cellular networks with mobile edge computing. In this integrated framework, the MEC server makes the offloading decision according to the local computation overhead estimated by all user equipments (UEs) and the offloading overhead estimated by the MEC server itself. Then, the …
Offloading computation to a mobile cloud is a promising solution to augment the computation capabilities of mobile devices. In this paper we consider selfish mobile devices in a dense wireless network, in which individual mobile devices can offload computations via multiple access points (APs) to a mobile cloud so as to minimize their computation costs, and we provide a game theoretical analysis of the problem. We show that in the case of an elastic cloud, all improvement paths are finite, and thus a pure strategy Nash equilibrium exists and can be computed easily. In the case of a non-elastic…
In mobile computation offloading (MCO), mobile devices (MDs) can choose to either execute tasks locally or to have them executed on a remote edge server (ES). This paper addresses the problem of assigning both the wireless communication bandwidth needed, along with the ES capacity that is used for the task execution, so that task completion time constraints are satisfied. The objective is to obtain these allocations so that the average power consumption of the mobile devices is minimized, subject to a cost budget constraint. The paper includes contributions for both soft and hard task completi…
Collaborative edge computing (CEC) is an emerging paradigm where heterogeneous edge devices (stakeholders) collaborate to fulfill computation tasks, such as model training or video processing, by sharing communication and computation resources. Nevertheless, the optimal data/result routing and computation offloading strategy in CEC with arbitrary topology still remains an open problem. In this paper, we formulate a partial-offloading and multi-hop routing model for arbitrarily divisible tasks. Each node individually decides the computation of the received data and the forwarding of data/result…
With the development of next-generation wireless networks, the Internet of Things (IoT) is evolving towards the intelligent IoT (iIoT), where intelligent applications usually have stringent delay and jitter requirements. In order to provide low-latency services to heterogeneous users in the emerging iIoT, multi-tier computing was proposed by effectively combining edge computing and fog computing. More specifically, multi-tier computing systems compensate for cloud computing through task offloading and dispersing computing tasks to multi-tier nodes along the continuum from the cloud to things. …
The main challenge in wireless sensor network is to improve the fault tolerance of each node and also provide an energy efficient fast data routing service. In this paper we propose an energy efficient node fault diagnosis and recovery for wireless sensor networks referred as fault tolerant multipath routing scheme for energy efficient wireless sensor network (FTMRS).The FTMRS is based on multipath data routing scheme. One shortest path is use for main data routing in FTMRS technique and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic…
Mobile wireless networks are intrinsically more prone to link congestion and outright failures than wired networks. In this paper, we elaborate the resilient routing reconfiguration method of \cite{WangEtAl} and generalize it to accomodate point-to-multipoint links and wireless networks. By reframing link failures as traffic uncertainties, this technique allows essentially instantaneous rerouting around arbitrary link failures while preventing congestion. We illustrate the technique by identifying a critical bottleneck in a realistic model wireless network.
In our paper we provide mathematical analysis of a probabilistic long-hop routing algorithms which uses as the randomizing factor the estimate of distance of a station from the previous-hop source of the message.
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. Hierarchical routing protocols are known to be the most energy-efficient routing protocols for Wireless Sensor Networks. In this paper, a more generalized hierarchical routing protocol is introduced for Wireless Sensor Network, which is based on tree data structures. The clustering in the proposed protocol has the format of a general tree, which is construc…
In this paper, we present analytical study of routing overhead of reactive routing protocols for Wireless Multihop Networks (WMhNs). To accomplish the framework of generalized routing overhead, we choose Ad-Hoc on Demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET on Demand (DYMO). Considering basic themes of these protocols, we enhance the generalized network models by adding route monitoring overhead. Later, we take different network parameters and produce framework discussing the impact of variations of these parameters in network and routing performance. In the s…
A fundamental understanding of gain provided by motion prediction in wireless ad hoc routing is currently lacking. This paper examines benefits in routing obtainable via prediction. A theoretical best-case non-predictive routing model is quantified in terms of both message overhead and update time for non-predictive routing. This best- case model of existing routing performance is compared with predictive routing. Several specific instances of predictive improvements in routing are examined. The primary contribution of this paper is quantification of predictive gain for wireless ad hoc routing…
In Wireless Ad-hoc Networks, nodes are free to move randomly and organize themselves arbitrarily, thus topology may change quickly and capriciously. In Mobile Ad-hoc NETworks, specially Wireless Multi-hop Networks provide users with facility of quick communication. In Wireless Multi-hop Networks, routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models to assess and enhance reactive routing protocols. To practically examine constraints of respective Linear Programming models over reactive pro…
This paper presents mathematical framework and study of proactive routing Protocols. The performance analysis of three major proactive routing protocols: Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR) are under consideration in this work. Taking these routing protocols into account, we enhance existing framework. In the next step we further discuss and produce analytical framework by considering variations in different network and protocol parameters. Finally, experiments are performed regarding above mentioned routing protoco…
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
In wireless sensor networks, an important issue of Geographic Routing is local minimum problem, which is caused by hole that blocks the greedy forwarding process. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole.
An energy efficient routing protocol is the major concern in Wireless Sensor Networks (WSNs). In this survey paper, we present energy efficient hierarchical routing protocols, developed from conventional LEACH routing protocol. Main focus of our study is how these extended protocols work in order to increase the life time and how quality routing protocol are improved for WSNs. Furthermore, this paper also highlights some of the issues faced by LEACH and also explains how these issues are tackled by extended versions of LEACH. We compare the features and performance issues of the selected hiera…
The main focus of this article is to achieve prolonged network lifetime with overall energy efficiency in wireless sensor networks through controlled utilization of limited energy. Major percentage of energy in wireless sensor network is consumed during routing from source to destination, retransmission of data on packet loss. For improvement, cross layered algorithm is proposed for routing and retransmission scheme. Simulation and results shows that this approach can save the overall energy consumption
Wireless sensor networks are harshly restricted by storage capacity, energy and computing power. So it is essential to design effective and energy aware protocol in order to enhance the network lifetime. In this paper, a review on routing protocol in WSNs is carried out which are classified as data-centric, hierarchical and location based depending on the network structure. Then some of the multipath routing protocols which are widely used in WSNs to improve network performance are also discussed. Advantages and disadvantages of each routing algorithm are discussed thereafter. Furthermore, thi…
In this paper, we consider the problem of finding the maximum routing throughput between any pair of nodes in an arbitrary multirate wireless mesh network (WMN) using multiple paths. Multipath routing is an efficient technique to maximize routing throughput in WMN, however maximizing multipath routing throughput is a NP-complete problem due to the shared medium for electromagnetic wave transmission in wireless channel, inducing collision-free scheduling as part of the optimization problem. In this work, we first provide problem formulation that incorporates collision-free schedule, and then ba…
In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In a…
This paper is about the wireless sensor network in environmental monitoring applications. A Wireless Sensor Network consists of many sensor nodes and a base station. The number and type of sensor nodes and the design protocols for any wireless sensor network is application specific. The sensor data in this application may be light intensity, temperature, pressure, humidity and their variations .Clustering and routing are the two areas which are given more attention in this paper.
This paper studies a novel user cooperation model in a wireless powered mobile edge computing system where two wireless users harvest wireless power transferred by one energy node and can offload part of their computation tasks to an edge server (ES) for remote execution. In particular, we consider that the direct communication link between one user to the ES is blocked, such that the other user acts as a relay to forward its offloading data to the server. Meanwhile, instead of forwarding all the received task data, we also allow the helping user to compute part of the received task locally to…
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 resources available at the sensor nodes. Most of these protocols are either based on single hop routing or multi hop routing and typically find the minimum energy path without addressing other issues such as time delay in delivering a packet, load balancing, and redundancy of data. Response time is very critical in environment monitoring sensor networks where ty…
Internet of Things (IoT) devices can apply mobile-edge computing (MEC) and energy harvesting (EH) to provide the satisfactory quality of experiences for computation intensive applications and prolong the battery lifetime. In this article, we investigate the computation offloading for IoT devices with energy harvesting in wireless networks with multiple MEC devices such as base stations and access points, each with different computation resource and radio communication capability. We propose a reinforcement learning based computation offloading framework for an IoT device to choose the MEC devi…
These Network Coding improves the network operation beyond the traditional routing or store-and-forward, by mixing of data stream within a network. Network coding techniques explicitly minimizes the total no of transmission in wireless network. The Coding-aware routing maximizes the coding opportunity by finding the coding possible path for every packet in the network. Here we propose CORMEN: a new coding-aware routing mechanism based on opportunistic routing. In CORMEN, every node independently can take the decision whether to code packets or not and forwarding of packets is based on the codi…
In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multi-hop wireless networks. These areas are critical--they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that, in case of uniform traffic, guarantees that every node of the network…
Our contribution in this paper is e3D, a diffusion based routing protocol that prolongs the system lifetime, evenly distributes the power dissipation throughout the network, and incurs minimal overhead for synchronizing communication. We compare e3D with other algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm.
Enabling real time applications in wireless sensor networks requires certain delay and bandwidth which pose more challenges in the design of routing protocols. The algorithm that is used for packet routing in such applications should be able to establish a tradeoff between end to end delay parameter and energy consumption. In this paper, we propose a new multi path routing algorithm for real time applications in wireless sensor networks namely QEMPAR which is QoS aware and can increase the network lifetime. Simulation results show that the proposed algorithm is more efficient than previous alg…
Today in fast technology development in wireless mobile adhoc network there is vast scope for research. As it is known that wireless communication for mobile network has many application areas like routing services, security services etc. The mobile adhoc network is the wireless network for communication in which the mobile nodes are organized without any centralized administrator. There are many Manet routing protocols like reactive, proactive, hybrid etc. In this paper the reactive Manet routing protocol like DSR is simulated for traffic analysis for 50 mobile nodes for IP traffic flows. Als…
With the rapid increase in demand for mobile data, mobile network operators are trying to expand wireless network capacity by deploying wireless local area network (LAN) hotspots on to which they can offload their mobile traffic. However, these network-centric methods usually do not fulfill the interests of mobile users (MUs). Taking into consideration many issues such as different applications' deadlines, monetary cost and energy consumption, how the MU decides whether to offload their traffic to a complementary wireless LAN is an important issue. Previous studies assume the MU's mobility pat…
Cluster based routing technique is most popular routing technique in Wireless Sensor Networks (WSNs). Due to varying need of WSN applications efficient energy utilization in routing protocols is still a potential area of research. In this research work we introduced a new energy efficient cluster based routing technique. In this technique we tried to overcome the problem of coverage hole and energy hole. In our technique we controlled these problems by introducing density controlled uniform distribution of nodes and fixing optimum number of Cluster Heads (CHs) in each round. Finally we verifie…
Many wireless protocols wait a small and random amount of time which is called jitter before sending a packet to avoid high contention and packet collision. Jitter has been already proposed for many routing protocols including AODV and LOADng. However, since they do not consider any link quality parameters or metrics (such as ETX) in routing, they fail to be efficient in metric-based routing protocols. A metric-based jitter mechanism is proposed in this paper and a closed form expression is derived that enables us to obtain the probability of delay inversion for all jitter mechanisms available…
A dynamic routing policy, referred to as Heat-Diffusion (HD), is developed for multihop uniclass wireless networks subject to random traffic, time-varying topology and inter-channel interference.The policy uses only current condition of queue occupancies and channel states, with requiring no knowledge of traffic and topology.Besides throughput optimality, HD minimizes an average quadratic routing cost defined by endowing each channel with a time-varying cost factor. Further, HD minimizes average network delay in the class of routing policies that base decisions only on current condition of tra…
In this paper, we have modeled the routing over- head generated by three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by reactive protocols consists of two phases; route discovery and route maintenance. Total cost paid by a protocol for efficient routing is sum of the cost paid in the form of energy consumed and time spent. These protocols majorly focus on the optimization performed by expanding ring search algorithm to control the flooding generated by the mechanism of blind flooding. So,…
In this paper, we propose LMEEC, a cluster-based routing protocol with low energy consumption for wireless sensor networks. Our protocol is based on a strategy which aims to provide a more reasonable exploitation of the selected nodes (cluster-heads) energy. Simulation results show the effectiveness of LMEEC in decreasing the energy consumption, and in prolonging the network lifetime, compared to LEACH.
Mobile-Edge Computing (MEC) is an emerging paradigm that provides a capillary distribution of cloud computing capabilities to the edge of the wireless access network, enabling rich services and applications in close proximity to the end users. In this article, a MEC enabled multi-cell wireless network is considered where each Base Station (BS) is equipped with a MEC server that can assist mobile users in executing computation-intensive tasks via task offloading. The problem of Joint Task Offloading and Resource Allocation (JTORA) is studied in order to maximize the users' task offloading gains…
The advancements of remote sensing (RS) pose increasingly high demands on computation and transmission resources. Conventional ground-offloading techniques, which transmit large amounts of raw data to the ground, suffer from poor satellite-to-ground link quality. In addition, existing satellite-offloading techniques, which offload computational tasks to low earth orbit (LEO) satellites located within the visible range of RS satellites for processing, cannot leverage the full computing capability of the network because the computational resources of visible LEO satellites are limited. This situ…
Many energy-aware routing protocols have been proposed for wireless sensor networks. Most of them are only energy savers and do not take care about energy balancing. The energy saver protocols try to decrease the energy consumption of the network as a whole; however the energy manager protocols balance the energy consumption in the network to avoid network partitioning. This means that energy saver protocols are not necessarily energy balancing and vice versa. However, the lifetime of wireless sensor network is strictly depending on energy consumption; therefore, energy management is an essent…
The effectiveness and simple implementation of physical layer jammers make them an essential threat for wireless networks. In a multihop wireless network, where jammers can interfere with the transmission of user messages at intermediate nodes along the path, one can employ jamming oblivious routing and then employ physical-layer techniques (e.g. spread spectrum) to suppress jamming. However, whereas these approaches can provide significant gains, the residual jamming can still severely limit system performance. This motivates the consideration of routing approaches that account for the differ…
Underwater optical wireless communication (UOWC) is becoming an attractive technology for underwater wireless sensor networks (UWSNs) since it offers high-speed communication links. Although UOWC overcomes the drawbacks of acoustic and radio frequency communication channels such as high latency and low data rate, yet, it has its own limitations. One of the major limitations of UOWC is its limited transmission range which demands to develop a multi-hop network with efficient routing protocols. Currently, the routing protocols for UOWSNs are centralized having high complexity and large end-to-en…
With the current exponential growth in traffic and service demands, device-to-device (D2D) cooperation is identified as a major mechanism to enable 5G networks to effectively and efficiently augment network resources. The effectiveness of D2D cooperation depends on a wide range of decision making processes that include cluster formation, resource allocation, in addition to connection and mobility management. Irrespective of the D2D cooperation scenario whether in sensor, ad hoc, or cellular networks, the literature normally assumes that devices selected as relays or data sources are reliable; …
A critical need in Mobile Wireless Sensor Network (MWSN) is to achieve energy efficiency during routing as the sensor nodes have scarce energy resource. The nodes' mobility in MWSN poses a challenge to design an energy efficient routing protocol. Clustering helps to achieve energy efficiency by reducing the organization complexity overhead of the network which is proportional to the number of nodes in the network. This paper proposes a novel hybrid multipath routing algorithm with an efficient clustering technique. A node is selected as cluster head if it has high surplus energy, better transm…
Underwater wireless sensor networks (UWSN), similar to the terrestrial sensor networks, have different challenges such as limited bandwidth, low battery power, defective underwater channels, and high variable propagation delay. A crucial problem in UWSN is finding an efficient route between a source and a destination. Consequently, great efforts have been made for designing efficient protocols while considering the unique characteristics of underwater communication. Several routing protocols are proposed for this issue and can be classified into geographic and non-geographic routing protocols.…
Backpressure routing and scheduling, with its throughput-optimal operation guarantee, is a promising technique to improve throughput in wireless multi-hop networks. Although backpressure is conceptually viewed as layered, the decisions of routing and scheduling are made jointly, which imposes several challenges in practice. In this work, we present Diff-Max, an approach that separates routing and scheduling and has three strengths: (i) Diff-Max improves throughput significantly, (ii) the separation of routing and scheduling makes practical implementation easier by minimizing cross-layer operat…
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 packets to reach the destination. Since these nodes operate in a physically insecure environment; they are vulnerable to different types of attacks such as selective forwarding and sinkhole. These attacks can inject malicious packets by compromising the node. Geographical routing protocols of wireless sensor networks have been developed without considering t…
In this paper, we identify and analyze the requirements to design a new routing link metric for wireless multihop networks. Considering these requirements, when a link metric is proposed, then both the design and implementation of the link metric with a routing protocol become easy. Secondly, the underlying network issues can easily be tackled. Thirdly, an appreciable performance of the network is guaranteed. Along with the existing implementation of three link metrics Expected Transmission Count (ETX), Minimum Delay (MD), and Minimum Loss (ML), we implement inverse ETX; invETX with Optimized …
In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them.
Wireless Multi-hop Networks (WMhNs) provide users with the facility to communicate while moving with whatever the node speed, the node density and the number of traffic flows they want, without any unwanted delay and/or disruption. This paper contributes Linear Programming models (LP_models) for WMhNs. In WMhNs, different routing protocols are used to facilitate users demand(s). To practically examine the constraints of respective LP_models over different routing techniques, we select three proactive routing protocols; Destination Sequence Distance Vector (DSDV), Fish-eye State Routing (FSR) a…
In this paper, we evaluate, analyze, and compare the impact of mobility on the behavior of three reactive protocols (AODV, DSR, DYMO) and three proactive protocols (DSDV, FSR, OLSR) in multi-hop wireless networks. We take into account throughput, end-to-end delay, and normalized routing load as performance parameters. Based upon the extensive simulation results in NS-2, we rank all of six protocols according to the performance parameters. Besides providing the interesting facts regarding the response of each protocol on varying mobilities and speeds, we also study the trade-offs, the routing p…
