• Title/Summary/Keyword: linear wireless sensor networks

Search Result 49, Processing Time 0.033 seconds

A Fast stream cipher Canon (고속 스트림 암호 Canon)

  • Kim, Gil-Ho
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.17 no.7
    • /
    • pp.71-79
    • /
    • 2012
  • Propose stream cipher Canon that need in Wireless sensor network construction that can secure confidentiality and integrity. Create Canon 128 bits streams key by 128 bits secret key and 128 bits IV, and makes 128 bits cipher text through whitening processing with produced streams key and 128 bits plaintext together. Canon for easy hardware implementation and software running fast algorithm consists only of simple logic operations. In particular, because it does not use S-boxes for non-linear operations, hardware implementation is very easy. Proposed stream cipher Canon shows fast speed test results performed better than AES, Salsa20, and gate number is small than Trivium. Canon purpose of the physical environment is very limited applications, mobile phones, wireless Internet environment, DRM (Digital Right Management), wireless sensor networks, RFID, and use software and hardware implementation easy 128 bits stream ciphers.

A New Estimation Model for Wireless Sensor Networks Based on the Spatial-Temporal Correlation Analysis

  • Ren, Xiaojun;Sug, HyonTai;Lee, HoonJae
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.2
    • /
    • pp.105-112
    • /
    • 2015
  • The estimation of missing sensor values is an important problem in sensor network applications, but the existing approaches have some limitations, such as the limitations of application scope and estimation accuracy. Therefore, in this paper, we propose a new estimation model based on a spatial-temporal correlation analysis (STCAM). STCAM can make full use of spatial and temporal correlations and can recognize whether the sensor parameters have a spatial correlation or a temporal correlation, and whether the missing sensor data are continuous. According to the recognition results, STCAM can choose one of the most suitable algorithms from among linear interpolation algorithm of temporal correlation analysis (TCA-LI), multiple regression algorithm of temporal correlation analysis (TCA-MR), spatial correlation analysis (SCA), spatial-temporal correlation analysis (STCA) to estimate the missing sensor data. STCAM was evaluated over Intel lab dataset and a traffic dataset, and the simulation experiment results show that STCAM has good estimation accuracy.

Lifetime Maximizing Routing Algorithm for Multi-hop Wireless Networks (다중-홉 무선 네트워크 환경에서 수명 최대화를 위한 라우팅 알고리즘)

  • Lee, Keon-Taek;Han, Seung-Jae;Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.292-300
    • /
    • 2008
  • In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

An Adaptive Temporal Suppression for Reducing Network Traffic in Wireless Sensor Networks (무선 센서 네트워크에서 통신량 감소를 위한 적응적 데이터 제한 기법)

  • Min, Joonki;Kwon, Youngmi
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.60-68
    • /
    • 2012
  • Current wireless sensor networks are considered to support more complex operations ranging from military to health care which require energy-efficient and timely transmission of large amounts of data. In this paper, we propose an adaptive temporal suppression algorithm which exploits a temporal correlation among sensor readings. The proposed scheme can significantly reduce the number of transmitted sensor readings by sensor node, and consequently decrease the energy consumption and delay. Instead of transmitting all sensor readings from sensor node to sink node, the proposed scheme is to selectively transmit some elements of sensor readings using the adaptive temporal suppression, and the sink node is able to reconstruct the original data without deteriorating data quality by linear interpolation. In our proposed scheme, sensing data stream at sensor node is divided into many small sensing windows and the transmission ratio in each window is decided by the window complexity. It is defined as the number of a fluctuation point which has greater absolute gradient than threshold value. We have been able to achieve up about 90% communication reduction while maintaining a minimal distortion ratio 6.5% in 3 samples among 4 ones.

Clustering and Communications Scheduling in WSNs using Mixed Integer Linear Programming

  • Avril, Francois;Bernard, Thibault;Bui, Alain;Sohier, Devan
    • Journal of Communications and Networks
    • /
    • v.16 no.4
    • /
    • pp.421-429
    • /
    • 2014
  • We consider the problem of scheduling communications in wireless sensor networks (WSNs) to ensure battery preservation through the use of the sleeping mode of sensors.We propose a communication protocol for 1-hop WSNs and extend it to multi-hop WSNs through the use of a 1-hop clustering algorithm.We propose to schedule communications in each cluster in a virtual communication ring so as to avoid collisions. Since clusters are cliques, only one sensor can speak or listen in a cluster at a time, and all sensors need to speak in each of their clusters at least once to realize the communication protocol. We model this situation as a mathematical program.

Cross Layer Optimal Design with Guaranteed Reliability under Rayleigh block fading channels

  • Chen, Xue;Hu, Yanling;Liu, Anfeng;Chen, Zhigang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3071-3095
    • /
    • 2013
  • Configuring optimization of wireless sensor networks, which can improve the network performance such as utilization efficiency and network lifetime with minimal energy, has received considerable attention in recent years. In this paper, a cross layer optimal approach is proposed for multi-source linear network and grid network under Rayleigh block-fading channels, which not only achieves an optimal utility but also guarantees the end-to-end reliability. Specifically, in this paper, we first strictly present the optimization method for optimal nodal number $N^*$, nodal placement $d^*$ and nodal transmission structure $p^*$ under constraints of minimum total energy consumption and minimum unit data transmitting energy consumption. Then, based on the facts that nodal energy consumption is higher for those nodes near the sink and those nodes far from the sink may have remaining energy, a cross layer optimal design is proposed to achieve balanced network energy consumption. The design adopts lower reliability requirement and shorter transmission distance for nodes near the sink, and adopts higher reliability requirement and farther transmission distance for nodes far from the sink, the solvability conditions is given as well. In the end, both the theoretical analysis and experimental results for performance evaluation show that the optimal design indeed can improve the network lifetime by 20-50%, network utility by 20% and guarantee desire level of reliability.

A Survey of the Transmission-Power-Control Schemes in Wireless Body-Sensor Networks

  • Lee, Woosik;Kim, Heeyoul;Hong, Min;Kang, Min-Goo;Jeong, Seung Ryul;Kim, Namgi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.4
    • /
    • pp.1854-1868
    • /
    • 2018
  • A wireless body-sensor network (WBSN) refers to a network-configured environment in which sensors are placed on both the inside and outside of the human body. The sensors are much smaller and the energy is more constrained when compared to traditional wireless sensor network (WSN) environments. The critical nature of the energy-constraint issue in WBSN environments has led to numerous studies on the reduction of energy consumption of WBSN sensors. The transmission-power-control (TPC) technique adjusts the transmission-power level (TPL) of sensors in the WBSN and reduces the energy consumption that occurs during communications. To elaborate, when transmission sensors and reception sensors are placed in various parts of the human body, the transmission sensors regularly send sensor data to the reception sensors. As the reception sensors receive data from the transmission sensors, real-time measurements of the received signal-strength indication (RSSI), which is the value that indicates the channel status, are taken to determine the TPL that suits the current-channel status. This TPL information is then sent back to the transmission sensors. The transmission sensors adjust their current TPL based on the TPL that they receive from the reception sensors. The initial TPC algorithm made linear or binary adjustments using only the information of the current-channel status. However, because various data in the WBSN environment can be utilized to create a more efficient TPC algorithm, many different types of TPC algorithms that combine human movements or fuse TPC with other algorithms have emerged. This paper defines and discusses the design and development process of an efficient TPC algorithm for WBSNs. We will describe the WBSN characteristics, model, and closed-loop mechanism, followed by an examination of recent TPC studies.

Recovery-Key Attacks against TMN-family Framework for Mobile Wireless Networks

  • Phuc, Tran Song Dat;Shin, Yong-Hyeon;Lee, Changhoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2148-2167
    • /
    • 2021
  • The proliferation of the Internet of Things (IoT) technologies and applications, especially the rapid rise in the use of mobile devices, from individuals to organizations, has led to the fundamental role of secure wireless networks in all aspects of services that presented with many opportunities and challenges. To ensure the CIA (confidentiality, integrity and accessibility) security model of the networks security and high efficiency of performance results in various resource-constrained applications and environments of the IoT platform, DDO-(data-driven operation) based constructions have been introduced as a primitive design that meet the demand of high speed encryption systems. Among of them, the TMN-family ciphers which were proposed by Tuan P.M., Do Thi B., etc., in 2016, are entirely suitable approaches for various communication applications of wireless mobile networks (WMNs) and advanced wireless sensor networks (WSNs) with high flexibility, applicability and mobility shown in two different algorithm selections, TMN64 and TMN128. The two ciphers provide strong security against known cryptanalysis, such as linear attacks and differential attacks. In this study, we demonstrate new probability results on the security of the two TMN construction versions - TMN64 and TMN128, by proposing efficient related-key recovery attacks. The high probability characteristics (DCs) are constructed under the related-key differential properties on a full number of function rounds of TMN64 and TMN128, as 10-rounds and 12-rounds, respectively. Hence, the amplified boomerang attacks can be applied to break these two ciphers with appropriate complexity of data and time consumptions. The work is expected to be extended and improved with the latest BCT technique for better cryptanalytic results in further research.

Adaptive Multi-view Video Interpolation Method Based on Inter-view Nonlinear Moving Blocks Estimation (시점 간 비선형 움직임 블록 예측에 기초한 적응적 다시점 비디오 보상 보간 기법)

  • Kim, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.4
    • /
    • pp.9-18
    • /
    • 2014
  • Recently, many researches have been focused on multi-view video applications and services such as wireless video surveillance networks, wireless video sensor networks and wireless mobile video. In multi-view video signal processing, to exploit the strong correlation between images acquired by different cameras plays great role in developing a core technique of multi-view video coding. This paper proposes an adaptive multi-view video interpolation technique which is applicable for multi-view distributed video coding without requiring any cooperation amongst the cameras. The proposed algorithm estimates the non-linear moving blocks and employs disparity compensated view prediction, and then fills in the unreliable blocks. Through computer simulations, it is shown that the proposed method outperforms the conventional methods.

Constrained Relay Node Deployment using an improved multi-objective Artificial Bee Colony in Wireless Sensor Networks

  • Yu, Wenjie;Li, Xunbo;Li, Xiang;Zeng, Zhi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.6
    • /
    • pp.2889-2909
    • /
    • 2017
  • Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.