Many internet applications can be adversely affected when end nodes are not in the same address realm and seek the assistance of NAT enroute to bridge the realms. NAT device alone cannot provide the necessary application/protocol transparency in all cases and seeks the assistance of Application Level Gateways (ALGs) where possible, to provide transparency. The purpose of this document is to ide...

When deploying a new mobile technology such as LTE, it is crucial to identify the factors that affect the radio network in terms of capacity and quality of service. In this context, network coverage is arguably the single most influential factor. This work presents a metaheuristic-optimization approach that automatically adapts the parameters of a signal-propagation model. The optimization proc...

Wireless sensor network is always deployed randomly in specific area for intrusion detection and environmental monitoring. Due to the hostile environment, the sensor nodes could not be replaced easily. The efficient energy consumption scheme is known to be more and more important. Meanwhile, saving the energy could not impact the coverage quality. Connecting proper sensors adaptively as a barri...

Least box number coverage problem for calculating the dimension of fractal networks is a NP-hard problem. In this paper, we proved that this problem is equivalent to a random ball coverage problem in statistical sense. So when we try to calculate the dimension of a large fractal network, it is not necessary to focus on the optimization of the least box number covering algorithm. We suggest that...

In this paper, we study a randomized scheduling algorithm, and analyze the problem of maximizing network lifetime under Quality of Service constraints such as bounded values of detection delay, detection probability, and network coverage intensity in wireless sensor networks. We show that the optimal solutions exist and provide the conditions of the existence of the optimal solutions. KeywordsW...

Power efficiency and coverage preservation are two important performance metrics for a wireless sensor network. However, there is scarcely any protocol to consider them at the same time. In this paper, we propose a flow-balanced routing (FBR) protocol for multi-hop clustered wireless sensor networks that attempts to achieve both power efficiency and coverage preservation. The proposed protocol ...

Original scientific paper Given temporal variability of farmland, the coverage rate of wireless sensor network (WSN) is usually low. There may arise the problems of blind spot area and congestion of hot spots. We propose a coverage strategy for heterogeneous nodes in WSN based on temporal variability of farmland, which predicts the key nodes using key node prediction model according to temporal...

Wireless networks are present everywhere but their management can be tricky since their coverage may contain holes even if the network is fully connected. In this paper we propose an algorithm that can build a communication tree between nodes of a wireless network with guarantee that there is no coverage hole in the tree. We use simplicial homology to compute mathematically the coverage, and Pr...

For 3G cellular networks, capacity becomes an additional objective along with coverage when characterizing the performance of high-data-rate services. Since network capacity depends on the degree traffic load is balanced over all cells, changing traffic patterns demand dynamic network reconfiguration to maintain good performance. We study the competitive character network coverage and capacity ...

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 ...