scispace - formally typeset
Search or ask a question
JournalISSN: 1551-9899

Ad Hoc & Sensor Wireless Networks 

About: Ad Hoc & Sensor Wireless Networks is an academic journal. The journal publishes majorly in the area(s): Wireless sensor network & Key distribution in wireless sensor networks. Over the lifetime, 418 publications have been published receiving 5778 citations.


Papers
More filters
Journal Article
TL;DR: A decentralized density control algorithm, Optimal Geographical Density Control (OGDC), is devised for density control in large scale sensor networks and can maintain coverage as well as connectivity, regardless of the relationship between the radio range and the sensing range.
Abstract: In this paper, we address the issues of maintaining sensing coverage and connectivity by keeping a minimum number of sensor nodes in the active mode in wireless sensor networks. We investigate the relationship between coverage and connectivity by solving the following two sub-problems. First, we prove that if the radio range is at least twice the sensing range, complete coverage of a convex area implies connectivity among the working set of nodes. Second, we derive, under the ideal case in which node density is sufficiently high, a set of optimality conditions under which a subset of working sensor nodes can be chosen for complete coverage. Based on the optimality conditions, we then devise a decentralized density control algorithm, Optimal Geographical Density Control (OGDC), for density control in large scale sensor networks. The OGDC algorithm is fully localized and can maintain coverage as well as connectivity, regardless of the relationship between the radio range and the sensing range. Ns-2 simulations show that OGDC outperforms existing density control algorithms [25, 26, 29] with respect to the number of working nodes needed and network lifetime (with up to 50% improvement), and achieves almost the same coverage as the algorithm with the best result.

1,559 citations

Journal Article
TL;DR: Algorithms to construct a network topology for wireless ad hoc network such that the maximum (or average) link (or node) interference of the topology is either minimized or approximately minimized are given.
Abstract: Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. Some researchers tried to reduce the interference by lowering node energy consumption (i.e. by reducing the transmission power) or by devising low degree topology controls, but none of those protocols can guarantee low interference. Recently, Burkhart et al. [?] proposed several methods to construct topologies whose maximum link interference is minimized while the topology is connected or is a spanner for Euclidean length. In this paper we give algorithms to construct a network topology for wireless ad hoc network such that the maximum (or average) link (or node) interference of the topology is either minimized or approximately minimized.

284 citations

Journal Article
Daojing He, Yi Gao, Sammy Chan, Chun Chen, Jiajun Bu 
TL;DR: An enhanced two-factor user authentication protocol for wireless sensor networks is presented and it is demonstrated that compared to the well-known authentication schemes, this proposal is more secure and efficient.
Abstract: Designing a user authentication protocol for wireless sensor networks is a difficult task because wireless networks are susceptible to attacks and sensor node has limited energy, processing and storage resources. Recently, several authentication schemes have been proposed. This short paper shows some security problems and design weaknesses in those schemes. Furthermore, an enhanced two-factor user authentication protocol is presented. The proposed scheme only uses hash function, and a successful user authentication just requires three message exchanges. Security and performance analyses demonstrate that compared to the well-known authentication schemes, our proposal is more secure and efficient.

238 citations

Journal Article
TL;DR: This work proposes a scheme for computing an optimized connected dominating set from multipoint relays that allows to efficiently broadcast packets without the last hop information with performances close to multipoint relay flooding.
Abstract: Multipoint relays offer an optimized way of flooding packets in a radio network. However, this technique requires the last hop knowledge: to decide wether or not a flooding packet is retransmitted, a node needs to know from which node the packet was received. When considering broadcasting at IP level, this information may be difficult to obtain. We thus propose a scheme for computing an optimized connected dominating set from multipoint relays. This set allows to efficiently broadcast packets without the last hop information with performances close to multipoint relay flooding.

235 citations

Journal Article
TL;DR: This work proposes a novel energy efficient clustering scheme (EECS) for single-hop wireless sensor networks, which better suits the periodical data gathering applications and introduces a novel distance-based method to balance the load among the cluster heads.
Abstract: Data gathering is a common but critical operation in many applications of wireless sensor networks.Innovative techniques that improve energy efficiency to prolong the network lifetime are highly required.Clustering is an effective topology control approach in wireless sensor networks, which can increase network scalability and lifetime.In this paper, we propose a novel energy efficient clustering scheme (EECS) for single-hop wireless sensor networks, which better suits the periodical data gathering applications.Our approach elects cluster heads with more residual energy in an autonomous manner through local radio communication with no iteration while achieving good cluster head distribution; further more, it introduces a novel distance-based method to balance the load among the cluster heads.Simulation results show that EECS prolongs the network lifetime significantly against the other clustering protocols such as LEACH and HEED.

203 citations

Network Information
Related Journals (5)
IEEE Transactions on Mobile Computing
3.8K papers, 178K citations
90% related
Computer Networks
5.9K papers, 261.1K citations
87% related
IEEE Transactions on Parallel and Distributed Systems
5.2K papers, 237.8K citations
86% related
IEEE ACM Transactions on Networking
4K papers, 296.9K citations
86% related
IEEE Internet of Things Journal
6.9K papers, 227.8K citations
86% related
Performance
Metrics
No. of papers from the Journal in previous years
YearPapers
20201
20191
20174
201642
201578
201450