Mobile node localization is one of the challenging and crucial issues in wireless sensor networks. The paper proposed a new approach to mobile localization, called LLA (Lee Localization Algorithm), to mitigate TOA measurement errors. The algorithm was divided into three phases: (1) pre-ranging algorithm was proposed to initialize localization by employing TOA method; (2) refinement algorithm wa...

Compressed sensing is a thriving research field covering a class of problems where a large sparse signal is reconstructed from a few random measurements. In the presence of several sensor nodes measuring correlated sparse signals, improvements in terms of recovery quality or the requirement for a fewer number of local measurements can be expected if the nodes cooperate. In this paper, we provid...

Wireless sensor network nodes are very tiny in size and their cost is also not very high. They are deployed in any geographical region in a random fashion. During the process of data sensing, data gathering and data transmission, the charge of the power unit associated with any node gets low, after certain time, i.e., each node has its life time. The life time of nodes directly affects the life...

Game Theory is fundamentally and applicably addressed and incorporated to analyze the coverage problems in Wireless Sensor Networks (WSN) in this paper. GCC (Game-theoretical Complete Coverage) algorithm is used to ensure whole network coverage mainly through adjusting the covering range of nodes and controlling the network redundancy. Hereafter, by designing suitable cost and utility function ...

In adversarial environments, disabling the communication capabilities of the enemy is a high priority. We introduce the problem of determining the optimal number and locations for a set of jamming devices in order to neutralize a wireless communication network. This problem is known as the WIRELESS NETWORK JAMMING PROBLEM. We develop several mathematical programming formulations based on coveri...

The hub location problem appears in a variety of applications including airline systems, cargo delivery systems, and telecommunication network design. When we analyze an application separately, we observe that each area has its own characteristics. Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. This...

This note extends the results of Frank, Jordán, and Szigeti [1] on parity constrained orientations with connectivity requirements. Given a hypergraph H, a non-negative intersecting supermodular set function p, and a preferred in-degree parity for every node, a formula is given on the minimum number of nodes with wrong in-degree parity in an orientation of H covering p. It is shown that the mini...

Wireless sensor network [1] generally consists of large number of sensor nodes. The wireless sensor network can be defined as large number of small sensing self powered nodes which gather the information from the geographical area and communicate in wireless fashion with the goal of handing their processed data to the base station. Due to the power restriction of sensor nodes, efficient routing...