Improving performance is an important issue in Wireless Sensor Networks (WSN). WSN has many limitations including network performance. The research question is how to reduce the amount of data transmitted to improve network performance?                                                                                                                  

    The work will include one of the dictionary compression methods which is Lempel Ziv Welch(LZW). One problem with the dictionary method is that the token size is fixed. The LZW dictionary method is not very useful with little data, because it loses many byt

Wireless  lietworking is·  constantly improving,  changing  and

though  ba ic  principle  is the same.  ['nstead of  using standard  cables  to transmit information fmm one point to another (qr more), it .uses  radio signals.  This paper  presents .a case  study considedng real-time remote

cqntroJ using Wireless UDP/JP-based networks,. The aim of-this werk is to

reduce  real-time· remote control  system  based upon a simulatio.n  model,

which can operate via general communication  l"]etworks, whieh on bodies. modern wireles  tcchnolqgy.

The  first  part includes· a  brief

The development of wireless sensor networks (WSNs) in the underwater environment leads to underwater WSN (UWSN). It has severe impact over the research field due to its extensive and real-time applications. However effective execution of underwater WSNs undergoes several problems. The main concern in the UWSN is sensor nodes’ energy depletion issue. Energy saving and maintaining quality of service (QoS) becomes highly essential for UWASN because of necessity of QoS application and confined sensor nodes (SNs). To overcome this problem, numerous prevailing methods like adaptive data forwarding techniques, QoS-based congestion control approaches, and various methods have been devised with maximum throughput and minimum network lifesp

The development of wireless sensor networks (WSNs) in the underwater environment leads to underwater WSN (UWSN). It has severe impact over the research field due to its extensive and real-time applications. However effective execution of underwater WSNs undergoes several problems. The main concern in the UWSN is sensor nodes’ energy depletion issue. Energy saving and maintaining quality of service (QoS) becomes highly essential for UWASN because of necessity of QoS application and confined sensor nodes (SNs). To overcome this problem, numerous prevailing methods like adaptive data forwarding techniques, QoS-based congestion control approaches, and various methods have been devised with maximum throughput and minimum network lifesp

Achieving energy-efficient Wireless Sensor Network (WSN) that monitors all targets at
all times is an essential challenge facing many large-scale surveillance applications.Singleobjective
set cover problem (SCP) is a well-known NP-hard optimization problem used to
set a minimum set of active sensors that efficiently cover all the targeted area. Realizing
that designing energy-efficient WSN and providing reliable coverage are in conflict with
each other, a multi-objective optimization tool is a strong choice for providing a set of
approximate Pareto optimal solutions (i.e., Pareto Front) that come up with tradeoff
between these two objectives. Thus, in the context of WSNs design problem, our main
contribution is to

<p>Energy and memory limitations are considerable constraints of sensor nodes in wireless sensor networks (WSNs). The limited energy supplied to network nodes causes WSNs to face crucial functional limitations. Therefore, the problem of limited energy resource on sensor nodes can only be addressed by using them efficiently. In this research work, an energy-balancing routing scheme for in-network data aggregation is presented. This scheme is referred to as Energy-aware and load-Balancing Routing scheme for Data Aggregation (hereinafter referred to as EBR-DA). The EBRDA aims to provide an energy efficient multiple-hop routing to the destination on the basis of the quality of the links between the source and destination. In

Establishing complete and reliable coverage for a long time-span is a crucial issue in densely surveillance wireless sensor networks (WSNs). Many scheduling algorithms have been proposed to model the problem as a maximum disjoint set covers (DSC) problem. The goal of DSC based algorithms is to schedule sensors into several disjoint subsets. One subset is assigned to be active, whereas, all remaining subsets are set to sleep. An extension to the maximum disjoint set covers problem has also been addressed in literature to allow for more advance sensors to adjust their sensing range. The problem, then, is extended to finding maximum number of overlapped set covers. Unlike all related works which concern with the disc sensing model, the cont

In this paper, we prove that our proposed localization algorithm named Improved
Accuracy Distribution localization for wireless sensor networks (IADLoc) [1] is the
best when it is compared with the other localization algorithms by introducing many
cases of studies. The IADLoc is used to minimize the error rate of localization
without any additional cost and minimum energy consumption and also
decentralized implementation. The IADLoc is a range free and also range based
localization algorithm that uses both type of antenna (directional and omnidirectional)
it allows sensors to determine their location based on the region of
intersection (ROI) when the beacon nodes send the information to the sink node and
the la