1,849 research outputs found
A Coverage Monitoring algorithm based on Learning Automata for Wireless Sensor Networks
To cover a set of targets with known locations within an area with limited or
prohibited ground access using a wireless sensor network, one approach is to
deploy the sensors remotely, from an aircraft. In this approach, the lack of
precise sensor placement is compensated by redundant de-ployment of sensor
nodes. This redundancy can also be used for extending the lifetime of the
network, if a proper scheduling mechanism is available for scheduling the
active and sleep times of sensor nodes in such a way that each node is in
active mode only if it is required to. In this pa-per, we propose an efficient
scheduling method based on learning automata and we called it LAML, in which
each node is equipped with a learning automaton, which helps the node to select
its proper state (active or sleep), at any given time. To study the performance
of the proposed method, computer simulations are conducted. Results of these
simulations show that the pro-posed scheduling method can better prolong the
lifetime of the network in comparison to similar existing method
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
Learning automata-based solution to target coverage problem for directional sensor networks with adjustable sensing ranges
The extensive applications of directional sensor networks (DSNs) in a wide range of situations have attracted a great deal of attention. One significant problem linked with DSNs is target coverage, which primarily operate based on simultaneously observing a group of targets occurring in a set area, hence maximizing the network lifetime. As there are limitations to the directional sensors’ sensing angle and energy resource, designing new techniques for effectively managing the energy consumption of the sensors is crucial. In this study, two problems were addressed. First, a new learning automata-based algorithm is proposed to solve the target coverage problem, in cases where sensors have multiple power levels (i.e., sensors have multiple sensing ranges), by selecting a subset of sensor directions that is able to monitor all the targets. In real applications, targets may have different coverage quality requirements, which leads to the second; the priority-based target coverage problem, which has not yet been investigated in the field of study. In this problem, two newly developed algorithms based on learning automata and greedy are proposed to select a subset of sensor directions in a way that different coverage quality requirements of all the targets could be satisfied. All of the proposed algorithms were assessed for their performances via a number of experiments. In addition, the effect of each algorithm on maximizing network lifetime was also investigated via a comparative study. All algorithms are successful in solving the problems; however, the learning automata-based algorithms are proven to be superior by up to 18% comparing with the greedy-based algorithms, when considering extending the network lifetime
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
- …