7,724 research outputs found
A Resource Intensive Traffic-Aware Scheme for Cluster-based Energy Conservation in Wireless Devices
Wireless traffic that is destined for a certain device in a network, can be
exploited in order to minimize the availability and delay trade-offs, and
mitigate the Energy consumption. The Energy Conservation (EC) mechanism can be
node-centric by considering the traversed nodal traffic in order to prolong the
network lifetime. This work describes a quantitative traffic-based approach
where a clustered Sleep-Proxy mechanism takes place in order to enable each
node to sleep according to the time duration of the active traffic that each
node expects and experiences. Sleep-proxies within the clusters are created
according to pairwise active-time comparison, where each node expects during
the active periods, a requested traffic. For resource availability and recovery
purposes, the caching mechanism takes place in case where the node for which
the traffic is destined is not available. The proposed scheme uses Role-based
nodes which are assigned to manipulate the traffic in a cluster, through the
time-oriented backward difference traffic evaluation scheme. Simulation study
is carried out for the proposed backward estimation scheme and the
effectiveness of the end-to-end EC mechanism taking into account a number of
metrics and measures for the effects while incrementing the sleep time duration
under the proposed framework. Comparative simulation results show that the
proposed scheme could be applied to infrastructure-less systems, providing
energy-efficient resource exchange with significant minimization in the power
consumption of each device.Comment: 6 pages, 8 figures, To appear in the proceedings of IEEE 14th
International Conference on High Performance Computing and Communications
(HPCC-2012) of the Third International Workshop on Wireless Networks and
Multimedia (WNM-2012), 25-27 June 2012, Liverpool, U
A Candour-based Trust and Reputation Management System for Mobile Ad Hoc Networks
The decentralized administrative controlled-nature of mobile ad hoc networks (MANETs) presents security vulnerabilities which can lead to attacks such as malicious modification of packets. To enhance security in MANETs, Trust and Reputation Management systems (TRM) have been developed to serve as measures in mitigating threats arising from unusual behaviours of nodes. In this paper we propose a candour-based trust and reputation system which measures and models reputation and trust propagation in MANETs. In the proposed model Dirichlet Probability Distribution is employed in modelling the individual reputation of nodes and the trust of each node is computed based on the node’s actual network performance and the quality of the recommendations it gives about other nodes. Cooperative nodes in our model will be rewarded for expanding their energy in forwarding packets for other nodes or for disseminating genuine recommenda-tions. Uncooperative nodes are isolated and denied the available network resources. We employed the Ruffle algorithm which will ensure that cooperative nodes are allowed to activate sleep mode when their service is not required in forwarding packets for its neighbouring trustworthy nodes. The proposed TRM system enshrines fairness in its mode of operation as well as creating an enabling environment free from bias. It will also ensure a connected and capacity preserving network of trustworthy node
Reliable Prediction of Channel Assignment Performance in Wireless Mesh Networks
The advancements in wireless mesh networks (WMN), and the surge in
multi-radio multi-channel (MRMC) WMN deployments have spawned a multitude of
network performance issues. These issues are intricately linked to the adverse
impact of endemic interference. Thus, interference mitigation is a primary
design objective in WMNs. Interference alleviation is often effected through
efficient channel allocation (CA) schemes which fully utilize the potential of
MRMC environment and also restrain the detrimental impact of interference.
However, numerous CA schemes have been proposed in research literature and
there is a lack of CA performance prediction techniques which could assist in
choosing a suitable CA for a given WMN. In this work, we propose a reliable
interference estimation and CA performance prediction approach. We demonstrate
its efficacy by substantiating the CA performance predictions for a given WMN
with experimental data obtained through rigorous simulations on an ns-3 802.11g
environment.Comment: Accepted in ICACCI-201
Multi-Channel Scheduling for Fast Convergecast in Wireless Sensor Networks
We explore the following fundamental question -
how fast can information be collected from a wireless sensor
network? We consider a number of design parameters such
as, power control, time and frequency scheduling, and routing.
There are essentially two factors that hinder efficient data
collection - interference and the half-duplex single-transceiver
radios. We show that while power control helps in reducing the
number of transmission slots to complete a convergecast under a
single frequency channel, scheduling transmissions on different
frequency channels is more efficient in mitigating the effects of
interference (empirically, 6 channels suffice for most 100-node
networks). With these observations, we define a receiver-based
channel assignment problem, and prove it to be NP-complete on
general graphs. We then introduce a greedy channel assignment
algorithm that efficiently eliminates interference, and compare
its performance with other existing schemes via simulations.
Once the interference is completely eliminated, we show that
with half-duplex single-transceiver radios the achievable schedule
length is lower-bounded by max(2nk − 1,N), where nk is the
maximum number of nodes on any subtree and N is the number
of nodes in the network. We modify an existing distributed time
slot assignment algorithm to achieve this bound when a suitable
balanced routing scheme is employed. Through extensive simulations,
we demonstrate that convergecast can be completed within
up to 50% less time slots, in 100-node networks, using multiple
channels as compared to that with single-channel communication.
Finally, we also demonstrate further improvements that are
possible when the sink is equipped with multiple transceivers
or when there are multiple sinks to collect data
Adjacency Matrix Based Energy Efficient Scheduling using S-MAC Protocol in Wireless Sensor Networks
Communication is the main motive in any Networks whether it is Wireless
Sensor Network, Ad-Hoc networks, Mobile Networks, Wired Networks, Local Area
Network, Metropolitan Area Network, Wireless Area Network etc, hence it must be
energy efficient. The main parameters for energy efficient communication are
maximizing network lifetime, saving energy at the different nodes, sending the
packets in minimum time delay, higher throughput etc. This paper focuses mainly
on the energy efficient communication with the help of Adjacency Matrix in the
Wireless Sensor Networks. The energy efficient scheduling can be done by
putting the idle node in to sleep node so energy at the idle node can be saved.
The proposed model in this paper first forms the adjacency matrix and
broadcasts the information about the total number of existing nodes with depths
to the other nodes in the same cluster from controller node. When every node
receives the node information about the other nodes for same cluster they
communicate based on the shortest depths and schedules the idle node in to
sleep mode for a specific time threshold so energy at the idle nodes can be
saved.Comment: 20 pages, 2 figures, 14 tables, 5 equations, International Journal of
Computer Networks & Communications (IJCNC),March 2012, Volume 4, No. 2, March
201
- …