3,413 research outputs found
Location aware sensor routing (LASeR) protocol for mobile wireless sensor networks
Location aware sensor routing (LASeR) protocol is a novel solution to the challenges of routing in mobile wireless sensor networks (MWSNs). It addresses the high reliability and low latency requirements of emerging applications. The protocol uses location information to maintain a gradient field even in highly mobile environments, whilst reducing the routing overhead. This allows the protocol to utilise a blind forwarding technique to propagate packets towards the sink. The protocol inherently utilises multiple paths simultaneously to create route diversity and increase its robustness. LASeR is designed for use in a high variety of MWSN applications with autonomous land, sea or air vehicles. Analytical expressions are derived and evaluated against the simulations. Extensive modelling and simulation of the proposed routing protocol has shown it to be highly adaptable and robust. It is compared with the recent MWSN proactive highly ambulatory sensor routing protocol, the high performance mobility adaptive cross-layer routing protocol, as well as ad-hoc on-demand distance vector and optimised link state routing. Protocols are evaluated on packet delivery ratio, end-to-end delay, overhead, throughput and energy consumption. The results highlight both the high performance of LASeR in various challenging environments and its superiority over the state-of-the-art
DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS
Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of
nodes, canbe used for a multitude of applications such as warfare intelligence or to
monitor the environment. A typical WSN node has a limited and usually an
irreplaceable power source and the efficient use of the available power is of utmost
importance to ensure maximum lifetime of eachWSNapplication. Each of the nodes
needs to transmit and communicate sensed data to an aggregation point for use by
higher layer systems. Data and message transmission among nodes collectively
consume the largest amount of energy available in WSNs. The network routing
protocols ensure that every message reaches thedestination and has a direct impact on
the amount of transmissions to deliver messages successfully. To this end, the
transmission protocol within the WSNs should be scalable, adaptable and optimized
to consume the least possible amount of energy to suite different network
architectures and application domains. The inclusion of mobile nodes in the WSNs
deployment proves to be detrimental to protocol performance in terms of nodes
energy efficiency and reliable message delivery. This thesis which proposes a novel
Mobile Data Collector based clustering routing protocol for WSNs is designed that
combines cluster based hierarchical architecture and utilizes three-tier multi-hop
routing strategy between cluster heads to base station by the help of Mobile Data
Collector (MDC) for inter-cluster communication. In addition, a Mobile Data
Collector based routing protocol is compared with Low Energy Adaptive Clustering
Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor
Networks routing protocol. The protocol is designed with the following in mind:
minimize the energy consumption of sensor nodes, resolve communication holes
issues, maintain data reliability, finally reach tradeoff between energy efficiency and
latency in terms of End-to-End, and channel access delays. Simulation results have
shown that the Mobile Data Collector based clustering routing protocol for WSNs
could be easily implemented in environmental applications where energy efficiency of
sensor nodes, network lifetime and data reliability are major concerns
Cross-layer design of multi-hop wireless networks
MULTI -hop wireless networks are usually defined as a collection of nodes
equipped with radio transmitters, which not only have the capability to
communicate each other in a multi-hop fashion, but also to route each others’ data
packets. The distributed nature of such networks makes them suitable for a variety of
applications where there are no assumed reliable central entities, or controllers, and
may significantly improve the scalability issues of conventional single-hop wireless
networks.
This Ph.D. dissertation mainly investigates two aspects of the research issues
related to the efficient multi-hop wireless networks design, namely: (a) network
protocols and (b) network management, both in cross-layer design paradigms to
ensure the notion of service quality, such as quality of service (QoS) in wireless mesh
networks (WMNs) for backhaul applications and quality of information (QoI) in
wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of
this Ph.D. dissertation, different network settings are used as illustrative examples,
however the proposed algorithms, methodologies, protocols, and models are not
restricted in the considered networks, but rather have wide applicability.
First, this dissertation proposes a cross-layer design framework integrating
a distributed proportional-fair scheduler and a QoS routing algorithm, while using
WMNs as an illustrative example. The proposed approach has significant performance
gain compared with other network protocols. Second, this dissertation proposes
a generic admission control methodology for any packet network, wired and
wireless, by modeling the network as a black box, and using a generic mathematical
0. Abstract 3
function and Taylor expansion to capture the admission impact. Third, this dissertation
further enhances the previous designs by proposing a negotiation process,
to bridge the applications’ service quality demands and the resource management,
while using WSNs as an illustrative example. This approach allows the negotiation
among different service classes and WSN resource allocations to reach the optimal
operational status. Finally, the guarantees of the service quality are extended to
the environment of multiple, disconnected, mobile subnetworks, where the question
of how to maintain communications using dynamically controlled, unmanned data
ferries is investigated
Building Programmable Wireless Networks: An Architectural Survey
In recent times, there have been a lot of efforts for improving the ossified
Internet architecture in a bid to sustain unstinted growth and innovation. A
major reason for the perceived architectural ossification is the lack of
ability to program the network as a system. This situation has resulted partly
from historical decisions in the original Internet design which emphasized
decentralized network operations through co-located data and control planes on
each network device. The situation for wireless networks is no different
resulting in a lot of complexity and a plethora of largely incompatible
wireless technologies. The emergence of "programmable wireless networks", that
allow greater flexibility, ease of management and configurability, is a step in
the right direction to overcome the aforementioned shortcomings of the wireless
networks. In this paper, we provide a broad overview of the architectures
proposed in literature for building programmable wireless networks focusing
primarily on three popular techniques, i.e., software defined networks,
cognitive radio networks, and virtualized networks. This survey is a
self-contained tutorial on these techniques and its applications. We also
discuss the opportunities and challenges in building next-generation
programmable wireless networks and identify open research issues and future
research directions.Comment: 19 page
Optimal coverage multi-path scheduling scheme with multiple mobile sinks for WSNs
Wireless Sensor Networks (WSNs) are usually formed with many tiny sensors which are randomly deployed within sensing field for target monitoring. These sensors can transmit their monitored data to the sink in a multi-hop communication manner. However, the ‘hot spots’ problem will be caused since nodes near sink will consume more energy during forwarding. Recently, mobile sink based technology provides an alternative solution for the long-distance communication and sensor nodes only need to use single hop communication to the mobile sink during data transmission. Even though it is difficult to consider many network metrics such as sensor position, residual energy and coverage rate etc., it is still very important to schedule a reasonable moving trajectory for the mobile sink. In this paper, a novel trajectory scheduling method based on coverage rate for multiple mobile sinks (TSCR-M) is presented especially for large-scale WSNs. An improved particle swarm optimization (PSO) combined with mutation operator is introduced to search the parking positions with optimal coverage rate. Then the genetic algorithm (GA) is adopted to schedule the moving trajectory for multiple mobile sinks. Extensive simulations are performed to validate the performance of our proposed method
DESIGN OF MOBILE DATA COLLECTOR BASED CLUSTERING ROUTING PROTOCOL FOR WIRELESS SENSOR NETWORKS
Wireless Sensor Networks (WSNs) consisting of hundreds or even thousands of
nodes, canbe used for a multitude of applications such as warfare intelligence or to
monitor the environment. A typical WSN node has a limited and usually an
irreplaceable power source and the efficient use of the available power is of utmost
importance to ensure maximum lifetime of eachWSNapplication. Each of the nodes
needs to transmit and communicate sensed data to an aggregation point for use by
higher layer systems. Data and message transmission among nodes collectively
consume the largest amount of energy available in WSNs. The network routing
protocols ensure that every message reaches thedestination and has a direct impact on
the amount of transmissions to deliver messages successfully. To this end, the
transmission protocol within the WSNs should be scalable, adaptable and optimized
to consume the least possible amount of energy to suite different network
architectures and application domains. The inclusion of mobile nodes in the WSNs
deployment proves to be detrimental to protocol performance in terms of nodes
energy efficiency and reliable message delivery. This thesis which proposes a novel
Mobile Data Collector based clustering routing protocol for WSNs is designed that
combines cluster based hierarchical architecture and utilizes three-tier multi-hop
routing strategy between cluster heads to base station by the help of Mobile Data
Collector (MDC) for inter-cluster communication. In addition, a Mobile Data
Collector based routing protocol is compared with Low Energy Adaptive Clustering
Hierarchy and A Novel Application Specific Network Protocol for Wireless Sensor
Networks routing protocol. The protocol is designed with the following in mind:
minimize the energy consumption of sensor nodes, resolve communication holes
issues, maintain data reliability, finally reach tradeoff between energy efficiency and
latency in terms of End-to-End, and channel access delays. Simulation results have
shown that the Mobile Data Collector based clustering routing protocol for WSNs
could be easily implemented in environmental applications where energy efficiency of
sensor nodes, network lifetime and data reliability are major concerns
A Review of Wireless Sensor Networks with Cognitive Radio Techniques and Applications
The advent of Wireless Sensor Networks (WSNs) has inspired various sciences and telecommunication with its applications, there is a growing demand for robust methodologies that can ensure extended lifetime. Sensor nodes are small equipment which may hold less electrical energy and preserve it until they reach the destination of the network. The main concern is supposed to carry out sensor routing process along with transferring information. Choosing the best route for transmission in a sensor node is necessary to reach the destination and conserve energy. Clustering in the network is considered to be an effective method for gathering of data and routing through the nodes in wireless sensor networks. The primary requirement is to extend network lifetime by minimizing the consumption of energy. Further integrating cognitive radio technique into sensor networks, that can make smart choices based on knowledge acquisition, reasoning, and information sharing may support the network's complete purposes amid the presence of several limitations and optimal targets. This examination focuses on routing and clustering using metaheuristic techniques and machine learning because these characteristics have a detrimental impact on cognitive radio wireless sensor node lifetime
- …