The proceedings contain 114 papers. The topics discussed include: undersea wireless sensor network for ocean pollution prevention;an effective group-based key establishment scheme for large-scale wireless sensor netwo...
详细信息
ISBN:
(纸本)9781424417971
The proceedings contain 114 papers. The topics discussed include: undersea wireless sensor network for ocean pollution prevention;an effective group-based key establishment scheme for large-scale wireless sensornetworks using bivariate polynomials;performance evaluation of a new overloading scheme for cellular DS-CDMA with iterative multistage interference cancellation receiver;experiments with low power commodity hardware platforms for challenged networks;smart middleware for mutual service-network awareness in evolving 3GPP networks;power allocation schemes for cognitive radios;communication in personal healthcare;hierarchical modeling of the Axis2 Web services framework with FMC-QE;extracting dense communities from telecom call graphs;OFDM-MAC algorithms and their impact on TCP in nextgeneration mobile networks;and a slotted ALOHA joint MAC-cum-routing protocol for data gathering sensor network applications.
Key distribution refers to the problem of establishing shared secrets on sensor nodes such that secret symmetric keys for communication privacy, integrity and authenticity can be generated. In a wireless sensor networ...
详细信息
ISBN:
(纸本)1595936955
Key distribution refers to the problem of establishing shared secrets on sensor nodes such that secret symmetric keys for communication privacy, integrity and authenticity can be generated. In a wireless sensor network, pre-distribution of secret keys is possibly the most practical approach to protect network communications but it is difficult due to the ad hoc nature, intermittent connectivity, and resource limitations of the sensornetworks. In this paper, we propose a key distribution scheme based on random key pre-distribution for heterogeneous sensor network (HSN) to achieve better performance and security as compared to homogeneous network which suffer from high communication overhead, computation overhead, and/or high storage requirements. In a key generation process, instead of generating a large pool of random keys, a key pool is represented by a small number of generation keys. For a given generation key and publicly known seed value, a one-way hash function generates a key chain, and these key chains collectively make a key pool. Each sensor node is assigned a small number of randomly selected generation keys. The proposed scheme reduces the storage requirements while maintaining the same security strength. Copyright 2007 ACM.
A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets in a given area. Because a directional s...
详细信息
ISBN:
(纸本)9780769530482
A directional sensor network consists of a number of directional sensors, which can switch to several directions to extend their sensing ability to cover the interested targets in a given area. Because a directional sensor has a smaller angle of sensing range or even does not cover any target when it is deployed, how to cover the interested targets becomes a major problem in directional sensornetworks. In this paper, we address the directional cover set problem (DCS) of finding a cover set in a directional sensor network, in which the directions cover all the targets. We propose both centralized and distributed algorithms for the DCS. We also introduce two applications that utilize these algorithms to extend the network work time while maximizing the coverage of the targets. Simulation results are presented to demonstrate the performance of these algorithms and the applications.
In this paper we present a monitoring assisted routing scheme for wireless mesh networks which exploits the broadcast nature of wireless transmissions at special rowers with added monitoring functionalities. These rou...
详细信息
ISBN:
(纸本)9781424414543
In this paper we present a monitoring assisted routing scheme for wireless mesh networks which exploits the broadcast nature of wireless transmissions at special rowers with added monitoring functionalities. These routers listen to the transmissions in neighborhood and compare, the routing behavior against the routing state collectively maintained by them. If any inconsistency is found, as a result of software/hardware malfunction, these routers try to determine the node causing it and recover from it in a timely fashion. The scheme is developed for wireless mesh networks where the communication overhead is a critical issue. The performance evaluation of our scheme shows considerable improvement in reliability (i.e., delivery ratio) with minimal overhead under situations of malfunctions.
Most routing algorithms for sensornetworks focus on finding energy efficient paths to prolong the lifetime of sensornetworks. As a result, the sensors on the efficient paths are depleted quickly, and consequently th...
详细信息
ISBN:
(纸本)97830540726050
Most routing algorithms for sensornetworks focus on finding energy efficient paths to prolong the lifetime of sensornetworks. As a result, the sensors on the efficient paths are depleted quickly, and consequently the sensornetworks become incapable of monitoring events from some parts of their target areas. In many sensor network applications, the events have uncertainties in positions and generation patterns. Therefore, routing algorithms should be designed to consider not only energy efficiency, but also the amount of energy left in each sensor to avoid sensors running out of power early. This paper introduces a new metric, called Energy-Welfare, devised to consider average and balance of sensors' remaining energies simultaneously. Using this metric, we design the Maximum Energy Welfare Routing algorithm, which achieves energy efficiency and energy balance of sensornetworks simultaneously. Moreover, we demonstrate the effectiveness of the proposed routing algorithm by comparing with three existing routing algorithms.
Wireless sensornetworks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack cal...
详细信息
ISBN:
(纸本)9780769529431
Wireless sensornetworks represent a new generation of real-time embedded systems with significantly different communication constraints from the traditional networked systems. With their development, a new attack called a path-based DoS (PDoS) attack has appeared In a PDoS attack, an adversary, either inside or outside the network, overwhelms sensor nodes by flooding a multi-hop end-to-end communication path with either replayed packets or injected spurious packets. Detection and recovery from PDoS attacks have not been given much attention in the literature. In this article, we propose a solution using mobile agents which can detect PDoS attacks easily and efficiently and recover the compromised nodes.
In many applications of sensornetworks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node is as small as possible. In this pape...
详细信息
ISBN:
(纸本)0769530486
In many applications of sensornetworks, it is essential to ensure that messages are transmitted to their destinations as early as possible and the buffer size of each sensor node is as small as possible. In this paper, we firstly propose a mesh sensor network system model. Based on this system model, the expressions for deriving the delay bound and buffer requirement bound are presented using network calculus. In order to balance traffic load and improve resource utilization, three traffic splitting mechanisms are proposed The numerical results show that the delay bound and buffer requirement bound are lowered while applying those traffic splitting mechanisms. And thus the performance of the whole sensor network is improved.
The traffic in IP networks has increased, and the diversification of services has advanced in recent years. Therefore, network carriers request services that they can provide as soon as possible and want to use large ...
详细信息
ISBN:
(纸本)9780769529134
The traffic in IP networks has increased, and the diversification of services has advanced in recent years. Therefore, network carriers request services that they can provide as soon as possible and want to use large scale networks for next-generation Network technologies. There is two kinds of problems. First is a taking a long time to develop new services. Second is a problem stemming from the processing of routing protocols using Interior Gateway Protocol in large scale IP networks such as carrier networks. As a solution for those problems, this paper presents a functionally distributed transport network architecture on NGN and a method to map routing functions to control-plane servers and routers where a routing process, performs route computation and distribution for multiple routers collectively. For the communication mechanism between routers and servers, the ForCES architecture model proposed in IETF is utilized. This paper also presents a route computation method using a link-state database that is configured based on suppressed representation of a network where a whole subnetwork is regarded as a router.
Queuing theoretical modeling is a commonly used method for load/capacity analyses of computer networks. This work presents a model for WLAN. In contrast to other works that offer analytical models aiming at general in...
详细信息
ISBN:
(纸本)9781424408566
Queuing theoretical modeling is a commonly used method for load/capacity analyses of computer networks. This work presents a model for WLAN. In contrast to other works that offer analytical models aiming at general insights to WLAN MAC properties (e.g. [6-9]), an empirical model for capacity analysis under concrete load conditions was developed. The model accounts for relevant communication problems on the OSI-layers 1-4. The presented work appeared within the scope of the network design environment CANDY Framework as one of multiple contributions under the subject,Wireless networks and their dimensioning" [8].
We study a new geographical routing protocol for Wireless sensornetworks (WSNs). Greedy Packet Forwarding (GPF) algorithm is an attractive localized routing scheme for wireless sensornetworks because of its directio...
详细信息
ISBN:
(纸本)9781424414307
We study a new geographical routing protocol for Wireless sensornetworks (WSNs). Greedy Packet Forwarding (GPF) algorithm is an attractive localized routing scheme for wireless sensornetworks because of its directional routing property and scalability. In pure GPF, we add a load balancing mechanism, which is also called an energy-aware algorithm. Based on the energy-aware GPF this paper considers lossy wireless link condition because the choice of high quality link reduces transmission errors. We call our algorithm Energy and Wireless link aware GPF (EWG). We use simulations to verify our algorithm and compare the performance with other methods. Our results show low transmission errors and extension of the network lifetime.
暂无评论