High Effect Secure Data Transmission Mechanisms in Wireless Sensor Networks Using ID-Based Key Management Scheme

Lin, Hua-Yi

doi:10.4156/jcit.vol4.issue1.lin

Cited by 6 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Assigning ID number to nodes in wireless networks is also reported in [18], where secure data transmission scheme is based on ID, and the ID adopts symmetric key. As noticed, our method assigns an array to each node.…”

Section: Destination-oriented Routing With Traffic Prioritymentioning

confidence: 99%

See 1 more Smart Citation

Destination-oriented Routing and Maximum Capacity Scheduling Algorithms in Cayley Graph Model for Wireless Mesh Network

et al. 2010

JCIT

View full text Add to dashboard Cite

Routing and scheduling act important roles in improving capacity and throughput in wireless mesh networks. In this paper, Cayley graph model is suggested for wireless Mesh Networks (WMN) with MIMO channels for efficient routing and fair scheduling. The model is based on the multiple interfaces, directional antennas, single channel mesh model. And the link edges or active edges can be viewed as connections between node pairs. A node can have as many links as its interface permits, but links are limited not conflicting with the interference model in wireless network. By placing edges into different channel plane virtually, the Cayley graph model allows a node to use maximum active edges under orthogonal channels. The model is helpful for WMN routing and scheduling schemes with the symmetry coding character in WMN. Consequently, layered active edge group scheduling algorithm and destination oriented routing schemes are proposed for maximum capacity and throughput. Furthermore, efficient transformations are used to take advantage of previous maximum active edge group scheduling for fairness.

show abstract

Section: Destination-oriented Routing With Traffic Prioritymentioning

confidence: 99%

“…And the array can be viewed as coordination, which is symmetric in each BS mesh in nature. As [18] mentioned symmetric ID is helpful to reduce CPU time, this may be result of ID coding simplicity and perfect symmetry properties.…”

Section: Destination-oriented Routing With Traffic Prioritymentioning

confidence: 99%

Destination-oriented Routing and Maximum Capacity Scheduling Algorithms in Cayley Graph Model for Wireless Mesh Network

et al. 2010

JCIT

View full text Add to dashboard Cite

show abstract

“…In the open environments, the communication channel in WSN can easily be manipulated by any malicious adversary. Security of wireless sensor networks is most essential [5][6][7][8]. One of the most important primitives for ensuring the security of WSN is authentication between the GWN and sensor nodes, between the GWN and users and between the sensor nodes and users [9].…”

Section: Introductionmentioning

confidence: 99%

Cryptanalyses of A Two-factor User Authentication Scheme in Wireless Sensor Networks

Tan¹

2011

AISS

View full text Add to dashboard Cite

Wireless sensor network (WSN) is applied broadly to a range of significantly different networking environments. The open environment of WSN requires mechanisms which prevent unauthorized users from accessing resources. User authentication in WSN is a critical security issue. Recently, M.L. Das proposed a two-factor user authentication scheme in WSNs. However, Khan et al. showed that the M.L. Das's scheme does not provide mutual authentication between the gateway node and sensor nodes. And it is vulnerable to gateway node bypassing attack and privileged-insider attacks. A new user authentication scheme in WSN is proposed. Unfortunately, we find that Khan et al.'s scheme suffers from password guessing attacks and the stolen verifier attacks. Finally, we propose an improved scheme with better security strength and higher efficiency.

show abstract

“…In both of these scenarios, the sink cannot be located near the sensors. Thus, data from sensors are transmitted to a central location (sink) where efficient and complex analysis takes place, which is demand for such energy and bandwidth, because transmission energy scales as n d ( n typically 2 4 -, d transmission distance) and transmission is the largest consumer of energy in WSN [6](For the energy cost of transmitting 1kb over a distance of 100 meters, a general purpose processor with 100MIPS/W power could execute million instructions). Besides, centralized processing is too slow for application with low latency requirement and leaves most of the processing capability of sensors unutilized.…”

Section: Introductionmentioning

confidence: 99%

Rough Set Based Generalized Fuzzy C-Means clustering Algorithm with Spatial Constraints for Distributed WSN Data Stream

Huang¹,

Zhang²

2011

JCIT

View full text Add to dashboard Cite

In practical applications, wireless sensor network (WSN) generate massive data streams with the spatial and sensor measurements information, and moreover, energy source of sensors is usually limited. Therefore, minimizing sensors energy expenditure and consequently extending the network lifetime is the major challenge in WSN. This paper presents an efficient distributed clustering algorithm based on FCM by incorporating the neighborhood sensor spatial information into the FCM algorithm (FCMS) to meet sensor data correlation increasing with decreasing spatial separation. FCMS can overcome the disadvantages of the known fuzzy c-means algorithms and at the same time enhances the clustering performance. The major characteristic of FCMS is the use of a fuzzy local ((both spatial and sensing measurements) similarity measure, aiming to partitions the sensor data into a set of spatial regions with similar sensing measurements. FCMS is initialized by Subtractive Clustering algorithm, in which the number of cluster and the cluster centers is taken to the FCMS Algorithm. The distributed FCMS (DFCMS) forms clusters of the sensor nodes sensing similar values and transmits features from the created local clusters as opposed to raw data per sensor node as in central clustering algorithm. Thus, DFCMS can significantly reduce the number of transmissions, which results in energy savings. Simulations reveal that DFCMS algorithm is effective and efficient with significantly less energy than that required by central FCM algorithm.

show abstract

High Effect Secure Data Transmission Mechanisms in Wireless Sensor Networks Using ID-Based Key Management Scheme

Cited by 6 publications

References 8 publications

Destination-oriented Routing and Maximum Capacity Scheduling Algorithms in Cayley Graph Model for Wireless Mesh Network

Destination-oriented Routing and Maximum Capacity Scheduling Algorithms in Cayley Graph Model for Wireless Mesh Network

Cryptanalyses of A Two-factor User Authentication Scheme in Wireless Sensor Networks

Rough Set Based Generalized Fuzzy C-Means clustering Algorithm with Spatial Constraints for Distributed WSN Data Stream

Contact Info

Product

Resources

About