Distributed Coverage Area Reporting for Wireless Sensor Networks

In order to efficiently deal with subscriptions or other location dependent information, it is key that the wireless sensor network informs the gateways what geographical area is serviced by which gateway. The gateways are then able to e.g. efficiently route subscriptions which are only valid in particular regions of the deployment. \ud \ud In our distributed approach of establishing a description of WSN coverage area per gateway, we let nodes keep track of the convex hull of the coverage area. In this way, gateways are efficiently informed of the service areas, while we limit the amount of information each node needs to store, transmit and receive

Study on the Rough-set-based Clustering Algorithm for Sensor Networks

The traditional clustering algorithm is a very typical level routing algorithm in wireless sensor networks (WSN). On the basis of the classical LEACH (Low Energy Adaptive Clustering Hierarchy) algorithm, this paper proposes an energy efficient clustering algorithm in WSN. Through the introduction of rough set, the new algorithm mainly introduces how to confirm an optimized strategy to choose the cluster head effectively by the simplified decision table. That is to say, by discrete normalized data preprocessing of attribute value, getting discretization decision table. Finally, the results from simulated experiments show that the clustering algorithm based on rough set theory can optimize the clustering algorithm in network data. That is to say, the rough-set-based clustering algorithm can effectively choose the cluster head, balance the energy of the nodes in the cluster and prolong the lifetime of sensor networks

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

Algorithms for Fast Aggregated Convergecast in Sensor Networks

Fast and periodic collection of aggregated data is of considerable interest for mission-critical and continuous monitoring applications in sensor networks. In the many-to-one communication paradigm, referred to as convergecast, we focus on applications wherein data packets are aggregated at each hop en-route to the sink along a tree-based routing topology, and address the problem of minimizing the convergecast schedule length by utilizing multiple frequency channels. The primary hindrance in minimizing the schedule length is the presence of interfering links. We prove that it is NP-complete to determine whether all the interfering links in an arbitrary network can be removed using at most a constant number of frequencies. We give a sufficient condition on the number of frequencies for which all the interfering links can be removed, and propose a polynomial time algorithm that minimizes the schedule length in this case. We also prove that minimizing the schedule length for a given number of frequencies on an arbitrary network is NP-complete, and describe a greedy scheme that gives a constant factor approximation on unit disk graphs. When the routing tree is not given as an input to the problem, we prove that a constant factor approximation is still achievable for degree-bounded trees. Finally, we evaluate our algorithms through simulations and compare their performance under different network parameters

Design of Combined Coverage Area Reporting and Geo-casting of Queries for Wireless Sensor Networks

In order to efficiently deal with queries or other location dependent information, it is key that the wireless sensor network informs gateways what geographical area is serviced by which gateway. The gateways are then able to e.g. efficiently route queries which are only valid in particular regions of the deployment. The proposed algorithms combine coverage area reporting and geographical routing of queries which are injected by gateways.\u