Abstract: Wireless mesh networking is rapidly gaining in
popularity with a variety of users: from municipalities to enterprises,
from telecom service providers to public safety and military
organizations. This increasing popularity is based on two basic facts:
ease of deployment and increase in network capacity expressed in
bandwidth per footage; WMNs do not rely on any fixed
infrastructure. Many efforts have been used to maximizing
throughput of the network in a multi-channel multi-radio wireless
mesh network. Current approaches are purely based on either static or
dynamic channel allocation approaches. In this paper, we use a
hybrid multichannel multi radio wireless mesh networking
architecture, where static and dynamic interfaces are built in the
nodes. Dynamic Adaptive Channel Allocation protocol (DACA), it
considers optimization for both throughput and delay in the channel
allocation. The assignment of the channel has been allocated to be codependent
with the routing problem in the wireless mesh network and
that should be based on passage flow on every link. Temporal and
spatial relationship rises to re compute the channel assignment every
time when the pattern changes in mesh network, channel assignment
algorithms assign channels in network. In this paper a computing
path which captures the available path bandwidth is the proposed
information and the proficient routing protocol based on the new path
which provides both static and dynamic links. The consistency
property guarantees that each node makes an appropriate packet
forwarding decision and balancing the control usage of the network,
so that a data packet will traverse through the right path.
Abstract: Securing the confidential data transferred via wireless
network remains a challenging problem. It is paramount to ensure
that data are accessible only by the legitimate users rather than by the
attackers. One of the most serious threats to organization is jamming,
which disrupts the communication between any two pairs of nodes.
Therefore, designing an attack-defending scheme without any packet
loss in data transmission is an important challenge. In this paper,
Dependence based Malicious Route Defending DMRD Scheme has
been proposed in multi path routing environment to prevent jamming
attack. The key idea is to defend the malicious route to ensure
perspicuous transmission. This scheme develops a two layered
architecture and it operates in two different steps. In the first step,
possible routes are captured and their agent dependence values are
marked using triple agents. In the second step, the dependence values
are compared by performing comparator filtering to detect malicious
route as well as to identify a reliable route for secured data
transmission. By simulation studies, it is observed that the proposed
scheme significantly identifies malicious route by attaining lower
delay time and route discovery time; it also achieves higher
throughput.
Abstract: This paper investigates the joint effect of the
interconnected (n,k)-star network topology and Multi-Agent
automated control on restoration and reconfiguration of power
systems. With the increasing trend in development in Multi-Agent
control technologies applied to power system reconfiguration
in presence of faulty components or nodes. Fault tolerance is
becoming an important challenge in the design processes of the
distributed power system topology. Since the reconfiguration of a
power system is performed by agent communication, the (n,k)-star
interconnected network topology is studied and modeled in this
paper to optimize the process of power reconfiguration. In this paper,
we discuss the recently proposed (n,k)-star topology and examine its
properties and advantages as compared to the traditional multi-bus
power topologies. We design and simulate the topology model for
distributed power system test cases. A related lemma based on the
fault tolerance and conditional diagnosability properties is presented
and proved both theoretically and practically. The conclusion is
reached that (n,k)-star topology model has measurable advantages
compared to standard bus power systems while exhibiting fault
tolerance properties in power restoration, as well as showing
efficiency when applied to power system route discovery.
Abstract: The aim of this paper is to propose a novel technique
to guarantee Quality of Service (QoS) in a highly dynamic
environment. The MANET changes its topology dynamically as the
nodes are moved frequently. This will cause link failure between
mobile nodes. MANET cannot ensure reliability without delay. The
relay node is selected based on achieving QoS in previous
transmission. It considers one more factor Connection Existence
Period (CEP) to ensure reliability. CEP is to find out the period
during that connection exists between the nodes. The node with
highest CEP becomes a next relay node. The relay node is selected
dynamically to avoid frequent failure. The bandwidth of each link
changed dynamically based on service rate and request rate. This
paper proposes Active bandwidth setting up algorithm to guarantee
the QoS. The series of results obtained by using the Network
Simulator (NS-2) demonstrate the viability of our proposed
techniques.
Abstract: Recent advances in wireless networking technologies
introduce several energy aware routing protocols in sensor networks.
Such protocols aim to extend the lifetime of network by reducing the
energy consumption of nodes. Many researchers are looking for
certain challenges that are predominant in the grounds of energy
consumption. One such protocol that addresses this energy
consumption issue is ‘Cluster based hierarchical routing protocol’. In
this paper, we intend to discuss some of the major hierarchical
routing protocols adhering towards sensor networks. Furthermore, we
examine and compare several aspects and characteristics of few
widely explored hierarchical clustering protocols, and its operations
in wireless sensor networks (WSN). This paper also presents a
discussion on the future research topics and the challenges of
hierarchical clustering in WSNs.
Abstract: This paper proposes a cooperative Alamouti space time
transmission scheme with low relay complexity for the cooperative
communication systems. In the proposed scheme, the source node
combines the data symbols to construct the Alamouti-coded form at
the destination node, while the conventional scheme performs the
corresponding operations at the relay nodes. In simulation results,
it is shown that the proposed scheme achieves the second order
cooperative diversity while maintaining the same bit error rate (BER)
performance as that of the conventional scheme.
Abstract: Data Grid is a geographically distributed environment that deals with data intensive application in scientific and enterprise computing. Data replication is a common method used to achieve efficient and fault-tolerant data access in Grids. In this paper, a dynamic data replication strategy, called Enhanced Latest Access Largest Weight (ELALW) is proposed. This strategy is an enhanced version of Latest Access Largest Weight strategy. However, replication should be used wisely because the storage capacity of each Grid site is limited. Thus, it is important to design an effective strategy for the replication replacement task. ELALW replaces replicas based on the number of requests in future, the size of the replica, and the number of copies of the file. It also improves access latency by selecting the best replica when various sites hold replicas. The proposed replica selection selects the best replica location from among the many replicas based on response time that can be determined by considering the data transfer time, the storage access latency, the replica requests that waiting in the storage queue and the distance between nodes. Simulation results utilizing the OptorSim show our replication strategy achieve better performance overall than other strategies in terms of job execution time, effective network usage and storage resource usage.
Abstract: Lately, with the increasing number of location-based applications, demand for highly accurate and reliable indoor localization became urgent. This is a challenging problem, due to the measurement variance which is the consequence of various factors like obstacles, equipment properties and environmental changes in complex nature of indoor environments. In this paper we propose low-cost custom-setup infrastructure solution and localization algorithm based on the Weighted Centroid Localization (WCL) method. Localization accuracy is increased by several enhancements: calibration of RSSI values gained from wireless nodes, repetitive measurements of RSSI to exclude deviating values from the position estimation, and by considering orientation of the device according to the wireless nodes. We conducted several experiments to evaluate the proposed algorithm. High accuracy of ~1m was achieved.
Abstract: Traditional Wireless Sensor Networks (WSNs) generally use static sinks to collect data from the sensor nodes via multiple forwarding. Therefore, network suffers with some problems like long message relay time, bottle neck problem which reduces the performance of the network.
Many approaches have been proposed to prevent this problem with the help of mobile sink to collect the data from the sensor nodes, but these approaches still suffer from the buffer overflow problem due to limited memory size of sensor nodes. This paper proposes an energy efficient scheme for data gathering which overcomes the buffer overflow problem. The proposed scheme creates virtual grid structure of heterogeneous nodes. Scheme has been designed for sensor nodes having variable sensing rate. Every node finds out its buffer overflow time and on the basis of this cluster heads are elected. A controlled traversing approach is used by the proposed scheme in order to transmit data to sink. The effectiveness of the proposed scheme is verified by simulation.
Abstract: This paper presents a wireless sensor network protocol for a car parking monitoring system. A wireless sensor network for the purpose is composed of multiple sensor nodes, a sink node, a gateway, and a server. Each of the sensor nodes is equipped with a 3-axis AMR sensor and deployed in the center of a parking space. The sensor node reads its sensor values periodically and transmits the data to the sink node if the current and immediate past sensor values show a difference exceeding a threshold value. The operations of the sink and sensor nodes are described in detail along with flow diagrams. The protocol allows a low-duty cycle operation of the sensor nodes and a flexible adjustment of the threshold value used by the sensor nodes.
Abstract: Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when G is the augmented cube AQn.
Abstract: Most ZigBee sensor networks to date make use of nodes with limited processing, communication, and energy capabilities. Energy consumption is of great importance in wireless sensor applications as their nodes are commonly battery-driven. Once ZigBee nodes are deployed outdoors, limited power may make a sensor network useless before its purpose is complete. At present, there are two strategies for long node and network lifetime. The first strategy is saving energy as much as possible. The energy consumption will be minimized through switching the node from active mode to sleep mode and routing protocol with ultra-low energy consumption. The second strategy is to evaluate the energy consumption of sensor applications as accurately as possible. Erroneous energy model may render a ZigBee sensor network useless before changing batteries.
In this paper, we present a ZigBee wireless sensor node with four key modules: a processing and radio unit, an energy harvesting unit, an energy storage unit, and a sensor unit. The processing unit uses CC2530 for controlling the sensor, carrying out routing protocol, and performing wireless communication with other nodes. The harvesting unit uses a 2W solar panel to provide lasting energy for the node. The storage unit consists of a rechargeable 1200 mAh Li-ion battery and a battery charger using a constant-current/constant-voltage algorithm. Our solution to extend node lifetime is implemented. Finally, a long-term sensor network test is used to exhibit the functionality of the solar powered system.
Abstract: Control flow graphs are a well-known representation of
the sequential control flow structure of programs with a multitude
of applications. Not only single functions but also sets of functions
or complete programs can be modeled by control flow graphs. In
this case the size of the graphs can grow considerably and thus
makes it difficult for software engineers to analyze the control flow.
Graph reductions are helpful in this situation. In this paper we define
reductions to subsets of nodes. Since executions of programs are
represented by paths through the control flow graphs, paths should
be preserved. Furthermore, the composition of reductions makes a
stepwise analysis approach possible.
Abstract: Vehicular Ad-hoc Network (VANET) is taking more
attention in automotive industry due to the safety concern of human
lives on roads. Security is one of the safety aspects in VANET. To be
secure, network availability must be obtained at all times since
availability of the network is critically needed when a node sends any
life critical information to other nodes. However, it can be expected
that security attacks are likely to increase in the coming future due to
more and more wireless applications being developed and deployed
onto the well-known expose nature of the wireless medium. In this
respect, the network availability is exposed to many types of attacks.
In this paper, Denial of Service (DOS) attack on network availability
is presented and its severity level in VANET environment is
elaborated. A model to secure the VANET from the DOS attacks has
been developed and some possible solutions to overcome the attacks
have been discussed.
Abstract: A packet analyzer is a tool for debugging sensor
network systems and is convenient for developers. In this paper, we
introduce a new packet analyzer based on an embedded system. The
proposed packet analyzer is compatible with IEEE 802.15.4, which is
suitable for the wireless communication standard for sensor networks,
and is available for remote control by adopting a server-client scheme
based on the Ethernet interface. To confirm the operations of the
packet analyzer, we have developed two types of sensor nodes based
on PIC4620 and ATmega128L microprocessors and tested the
functions of the proposed packet analyzer by obtaining the packets
from the sensor nodes.
Abstract: The Mobile IP Standard has been developed to support mobility over the Internet. This standard contains several drawbacks as in the cases where packets are routed via sub-optimal paths and significant amount of signaling messages is generated due to the home registration procedure which keeps the network aware of the current location of the mobile nodes. Recently, a dynamic hierarchical mobility management strategy for mobile IP networks (DHMIP) has been proposed to reduce home registrations costs. However, this strategy induces a packet delivery delay and increases the risk of packet loss. In this paper, we propose an enhanced version of the dynamic hierarchical strategy that reduces the packet delivery delay and minimizes the risk of packet loss. Preliminary results obtained from simulations are promising. They show that the enhanced version outperforms the original dynamic hierarchical mobility management strategy version.
Abstract: This paper proposes a model of adding relations between
members of the same level in a pyramid organization structure
which is a complete K-ary tree such that the communication of
information between every member in the organization becomes the
most efficient. When edges between one node and every other node
with the same depth N in a complete K-ary tree of height H are
added, an optimal depth N* = H is obtained by minimizing the total
path length which is the sum of lengths of shortest paths between
every pair of all nodes.
Abstract: Solar power plants(SPPs) have shown a lot of good outcomes
in providing a various functions depending on industrial expectations by
deploying ad-hoc networking with helps of light loaded and battery powered
sensor nodes. In particular, it is strongly requested to develop an algorithm to
deriver the sensing data from the end node of solar power plants to the sink node
on time. In this paper, based on the above observation we have proposed an
IEEE802.15.4 based self routing scheme for solar power plants. The proposed
beacon based priority routing Algorithm (BPRA) scheme utilizes beacon
periods in sending message with embedding the high priority data and thus
provides high quality of service(QoS) in the given criteria. The performance
measures are the packet Throughput, delivery, latency, total energy
consumption. Simulation results under TinyOS Simulator(TOSSIM) have
shown the proposed scheme outcome the conventional Ad hoc On-Demand
Distance Vector(AODV) Routing in solar power plants.
Abstract: Using Internet communication, new home electronics
have functions of monitoring and control from remote. However in
many case these electronics work as standalone, and old electronics
are not followed. Then, we developed the total remote system include
not only new electronics but olds. This systems node is a adapter of
electrical power plug that embed relay switch and some sensors, and
these nodes communicate with each other. the system server was build
on the Internet, and users access to this system from web browsers.
To reduce the cost to set up of this system, communication between
adapters are used ZigBee wireless network instead of wired LAN
cable[3]. From measured RSSI(received signal strength indicator)
information between each nodes, the system can estimate roughly
adapters were mounted on which room, and where in the room. So
also it reduces the cost of mapping nodes. Using this system, energy
saving and house monitoring are expected.
Abstract: In this paper, we propose a dynamic TDMA slot
reservation (DTSR) protocol for cognitive radio ad hoc networks.
Quality of Service (QoS) guarantee plays a critically important role
in such networks. We consider the problem of providing QoS
guarantee to users as well as to maintain the most efficient use of
scarce bandwidth resources. According to one hop neighboring
information and the bandwidth requirement, our proposed protocol
dynamically changes the frame length and the transmission schedule.
A dynamic frame length expansion and shrinking scheme that
controls the excessive increase of unassigned slots has been
proposed. This method efficiently utilizes the channel bandwidth by
assigning unused slots to new neighboring nodes and increasing the
frame length when the number of slots in the frame is insufficient to
support the neighboring nodes. It also shrinks the frame length when
half of the slots in the frame of a node are empty. An efficient slot
reservation protocol not only guarantees successful data
transmissions without collisions but also enhance channel spatial
reuse to maximize the system throughput. Our proposed scheme,
which provides both QoS guarantee and efficient resource utilization,
be employed to optimize the channel spatial reuse and maximize the
system throughput. Extensive simulation results show that the
proposed mechanism achieves desirable performance in multichannel
multi-rate cognitive radio ad hoc networks.