25,875 research outputs found
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
Security in Wireless Sensor Networks: Issues and Challenges
Wireless Sensor Network (WSN) is an emerging technology that shows great
promise for various futuristic applications both for mass public and military.
The sensing technology combined with processing power and wireless
communication makes it lucrative for being exploited in abundance in future.
The inclusion of wireless communication technology also incurs various types of
security threats. The intent of this paper is to investigate the security
related issues and challenges in wireless sensor networks. We identify the
security threats, review proposed security mechanisms for wireless sensor
networks. We also discuss the holistic view of security for ensuring layered
and robust security in wireless sensor networks.Comment: 6 page
Developing an Efficient DMCIS with Next-Generation Wireless Networks
The impact of extreme events across the globe is extraordinary which
continues to handicap the advancement of the struggling developing societies
and threatens most of the industrialized countries in the globe. Various fields
of Information and Communication Technology have widely been used for efficient
disaster management; but only to a limited extent though, there is a tremendous
potential for increasing efficiency and effectiveness in coping with disasters
with the utilization of emerging wireless network technologies. Early warning,
response to the particular situation and proper recovery are among the main
focuses of an efficient disaster management system today. Considering these
aspects, in this paper we propose a framework for developing an efficient
Disaster Management Communications and Information System (DMCIS) which is
basically benefited by the exploitation of the emerging wireless network
technologies combined with other networking and data processing technologies.Comment: 6 page
A Secure Lightweight Approach of Node Membership Verification in Dense HDSN
In this paper, we consider a particular type of deployment scenario of a
distributed sensor network (DSN), where sensors of different types and
categories are densely deployed in the same target area. In this network, the
sensors are associated with different groups, based on their functional types
and after deployment they collaborate with one another in the same group for
doing any assigned task for that particular group. We term this sort of DSN as
a heterogeneous distributed sensor network (HDSN). Considering this scenario,
we propose a secure membership verification mechanism using one-way accumulator
(OWA) which ensures that, before collaborating for a particular task, any pair
of nodes in the same deployment group can verify each other-s legitimacy of
membership. Our scheme also supports addition and deletion of members (nodes)
in a particular group in the HDSN. Our analysis shows that, the proposed scheme
could work well in conjunction with other security mechanisms for sensor
networks and is very effective to resist any adversary-s attempt to be included
in a legitimate group in the network.Comment: 6 page
Hierarchical Design Based Intrusion Detection System For Wireless Ad hoc Network
In recent years, wireless ad hoc sensor network becomes popular both in civil
and military jobs. However, security is one of the significant challenges for
sensor network because of their deployment in open and unprotected environment.
As cryptographic mechanism is not enough to protect sensor network from
external attacks, intrusion detection system needs to be introduced. Though
intrusion prevention mechanism is one of the major and efficient methods
against attacks, but there might be some attacks for which prevention method is
not known. Besides preventing the system from some known attacks, intrusion
detection system gather necessary information related to attack technique and
help in the development of intrusion prevention system. In addition to
reviewing the present attacks available in wireless sensor network this paper
examines the current efforts to intrusion detection system against wireless
sensor network. In this paper we propose a hierarchical architectural design
based intrusion detection system that fits the current demands and restrictions
of wireless ad hoc sensor network. In this proposed intrusion detection system
architecture we followed clustering mechanism to build a four level
hierarchical network which enhances network scalability to large geographical
area and use both anomaly and misuse detection techniques for intrusion
detection. We introduce policy based detection mechanism as well as intrusion
response together with GSM cell concept for intrusion detection architecture.Comment: 16 pages, International Journal of Network Security & Its
Applications (IJNSA), Vol.2, No.3, July 2010. arXiv admin note: text overlap
with arXiv:1111.1933 by other author
Extremal Properties of Three Dimensional Sensor Networks with Applications
In this paper, we analyze various critical transmitting/sensing ranges for
connectivity and coverage in three-dimensional sensor networks. As in other
large-scale complex systems, many global parameters of sensor networks undergo
phase transitions: For a given property of the network, there is a critical
threshold, corresponding to the minimum amount of the communication effort or
power expenditure by individual nodes, above (resp. below) which the property
exists with high (resp. a low) probability. For sensor networks, properties of
interest include simple and multiple degrees of connectivity/coverage. First,
we investigate the network topology according to the region of deployment, the
number of deployed sensors and their transmitting/sensing ranges. More
specifically, we consider the following problems: Assume that nodes, each
capable of sensing events within a radius of , are randomly and uniformly
distributed in a 3-dimensional region of volume , how large
must the sensing range be to ensure a given degree of coverage of the region to
monitor? For a given transmission range, what is the minimum (resp. maximum)
degree of the network? What is then the typical hop-diameter of the underlying
network? Next, we show how these results affect algorithmic aspects of the
network by designing specific distributed protocols for sensor networks
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
Energy Efficient Node Deployment in Wireless Ad-hoc Sensor Networks
We study a wireless ad-hoc sensor network (WASN) where sensors gather
data from the surrounding environment and transmit their sensed information to
fusion centers (FCs) via multi-hop wireless communications. This node
deployment problem is formulated as an optimization problem to make a trade-off
between the sensing uncertainty and energy consumption of the network. Our
primary goal is to find an optimal deployment of sensors and FCs to minimize a
Lagrange combination of the sensing uncertainty and energy consumption. To
support arbitrary routing protocols in WASNs, the routing-dependent necessary
conditions for the optimal deployment are explored. Based on these necessary
conditions, we propose a routing-aware Lloyd algorithm to optimize node
deployment. Simulation results show that, on average, the proposed algorithm
outperforms the existing deployment algorithms.Comment: 7 pages, 6 figure
- …