29,204 research outputs found
Recommended from our members
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
Movement-efficient Sensor Deployment in Wireless Sensor Networks
We study a mobile wireless sensor network (MWSN) consisting of multiple
mobile sensors or robots. Two key issues in MWSNs - energy consumption, which
is dominated by sensor movement, and sensing coverage - have attracted plenty
of attention, but the interaction of these issues is not well studied. To take
both sensing coverage and movement energy consumption into consideration, we
model the sensor deployment problem as a constrained source coding problem. %,
which can be applied to different coverage tasks, such as area coverage, target
coverage, and barrier coverage. Our goal is to find an optimal sensor
deployment to maximize the sensing coverage with specific energy constraints.
We derive necessary conditions to the optimal sensor deployment with (i) total
energy constraint and (ii) network lifetime constraint. Using these necessary
conditions, we design Lloyd-like algorithms to provide a trade-off between
sensing coverage and energy consumption. Simulation results show that our
algorithms outperform the existing relocation algorithms.Comment: 18 pages, 10 figure
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
Robotic Wireless Sensor Networks
In this chapter, we present a literature survey of an emerging, cutting-edge,
and multi-disciplinary field of research at the intersection of Robotics and
Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor
Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system
that aims to achieve certain sensing goals while meeting and maintaining
certain communication performance requirements, through cooperative control,
learning and adaptation. While both of the component areas, i.e., Robotics and
WSN, are very well-known and well-explored, there exist a whole set of new
opportunities and research directions at the intersection of these two fields
which are relatively or even completely unexplored. One such example would be
the use of a set of robotic routers to set up a temporary communication path
between a sender and a receiver that uses the controlled mobility to the
advantage of packet routing. We find that there exist only a limited number of
articles to be directly categorized as RWSN related works whereas there exist a
range of articles in the robotics and the WSN literature that are also relevant
to this new field of research. To connect the dots, we first identify the core
problems and research trends related to RWSN such as connectivity,
localization, routing, and robust flow of information. Next, we classify the
existing research on RWSN as well as the relevant state-of-the-arts from
robotics and WSN community according to the problems and trends identified in
the first step. Lastly, we analyze what is missing in the existing literature,
and identify topics that require more research attention in the future
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Future wireless networks have a substantial potential in terms of supporting
a broad range of complex compelling applications both in military and civilian
fields, where the users are able to enjoy high-rate, low-latency, low-cost and
reliable information services. Achieving this ambitious goal requires new radio
techniques for adaptive learning and intelligent decision making because of the
complex heterogeneous nature of the network structures and wireless services.
Machine learning (ML) algorithms have great success in supporting big data
analytics, efficient parameter estimation and interactive decision making.
Hence, in this article, we review the thirty-year history of ML by elaborating
on supervised learning, unsupervised learning, reinforcement learning and deep
learning. Furthermore, we investigate their employment in the compelling
applications of wireless networks, including heterogeneous networks (HetNets),
cognitive radios (CR), Internet of things (IoT), machine to machine networks
(M2M), and so on. This article aims for assisting the readers in clarifying the
motivation and methodology of the various ML algorithms, so as to invoke them
for hitherto unexplored services as well as scenarios of future wireless
networks.Comment: 46 pages, 22 fig
A survey of self organisation in future cellular networks
This article surveys the literature over the period of the last decade on the emerging field of self organisation as applied to wireless cellular communication networks. Self organisation has been extensively studied and applied in adhoc networks, wireless sensor networks and autonomic computer networks; however in the context of wireless cellular networks, this is the first attempt to put in perspective the various efforts in form of a tutorial/survey. We provide a comprehensive survey of the existing literature, projects and standards in self organising cellular networks. Additionally, we also aim to present a clear understanding of this active research area, identifying a clear taxonomy and guidelines for design of self organising mechanisms. We compare strength and weakness of existing solutions and highlight the key research areas for further development. This paper serves as a guide and a starting point for anyone willing to delve into research on self organisation in wireless cellular communication networks
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission
Collaborative beamforming (CB) and cooperative transmission (CT) have
recently emerged as communication techniques that can make effective use of
collaborative/cooperative nodes to create a virtual
multiple-input/multiple-output (MIMO) system. Extending the lifetime of
networks composed of battery-operated nodes is a key issue in the design and
operation of wireless sensor networks. This paper considers the effects on
network lifetime of allowing closely located nodes to use CB/CT to reduce the
load or even to avoid packet-forwarding requests to nodes that have critical
battery life. First, the effectiveness of CB/CT in improving the signal
strength at a faraway destination using energy in nearby nodes is studied.
Then, the performance improvement obtained by this technique is analyzed for a
special 2D disk case. Further, for general networks in which
information-generation rates are fixed, a new routing problem is formulated as
a linear programming problem, while for other general networks, the cost for
routing is dynamically adjusted according to the amount of energy remaining and
the effectiveness of CB/CT. From the analysis and the simulation results, it is
seen that the proposed method can reduce the payloads of energy-depleting nodes
by about 90% in the special case network considered and improve the lifetimes
of general networks by about 10%, compared with existing techniques.Comment: Invited paper to appear in the IEE Proceedings: Microwaves, Antennas
and Propagation, Special Issue on Antenna Systems and Propagation for Future
Wireless Communication
- …