Ternary polynomial based key management scheme for wireless sensor network by Zhi-tao GUAN, Yue XU, Jun WU

“…A ternary polynomial based key management (KMTP) scheme was proposed,which is effective in cluster based wireless sensor networks.Firstly,the base station will give each node one unique identi ier to ensure the validity of the node.Then,algorithm of the inner-cluster and inter-cluster key pre-distribution based on the ternary polynomial of the same order was stated,which can ensure the value of the cracking threshold is bigger than the number of nodes of a clus-ter and all clusters separately,which means it's very hard to be cracked even all nodes of a cluster or all clusters are com-promised.To assure the communication security,inter-cluster multi-hop routing mechanism was designed based on con-structing secure conjunct neighbor table.Finally,the updating parameter and the updating authentication number were in-troduced in rekeying phase.The analysis shows that the proposed scheme can meet the security requirement of key man-agement,and it also has less computation cost and storage cost than the existing schemes.…”
Get full text

A Path-Priority Based Relay Selection Algorithm for VoIP by Hua Qu, Jihong Zhao, Lixia Wang, Shiqi Dong

“…The algorithm reduced the delay further through two-hop relay selection algorithm at last. Simulation results show that the proposed method can reduce the transmission delay of VoIP services and enhance the user experience of VoIP.…”
Get full text

Data transmission algorithm of vehicle Ad Hoc network based on channel switching by Tiaojuan REN, Jinhao WAN, Yourong CHEN, Siyi LU, Banteng LIU

“…A data transmission algorithm of vehicle Ad Hoc network based on channel switching (DTA) was proposed.In the DTA,three network layers were considered,such as vehicle nodes,relay nodes and sink nodes.The vehicle nodes were classified by the information of vehicle’s driving direction.The vehicle nodes channel distribution and switching mechanism was proposed to reduce the interference of communication.Then a rapid transmission of relay nodes was proposed.A priority transmission method for emergency information was proposed to classify data with different queues and send data as their queues’ priority.Simulation results show that DTA can effectively achieve the rapid transmission of useful information,reduce unnecessary losses of energy,improve the data received rate of sink nodes,reduce the average hop number of data packets and improve coverage rate of data transmission.Under certain conditions,DTA is better than AODV and AODV-L algorithm,and is more suitable for vehicle driving environment of rapid change.…”
Get full text

An Energy-Efficient Transmission Protocol for RNC-Based Cooperative WSNs with Partial Energy Harvesting Nodes by Yulun Cheng, Longxiang Yang

“…The obtained theoretical and simulation results indicate that the proposed protocol achieves superiority in energy efficiency; meanwhile, it can also provide similar transmission reliability under specific conditions, as compared to the conventional algorithms in the two-hop model.…”
Get full text

PHẢN ỨNG CỦA 1,1-DIARYLETEN VỚI ETYL MALONAT TRONG SỰ CÓ MẶT CỦA MANGAN TRIXETAT: PHÂN TÍCH PHỔ NGHIỆM MỘT SỐ LACTION MỚI by Nguyễn Thị Đoan Trang, Huỳnh Thanh Trúc, Nguyễn Văn Hạ

“…Phản ứng oxy hóa hỗn hợp 1,1-diaryleten hoặc 1,1,6,6-tetraphenylhexa-1.5-dien và dietyl malonat bằng mangan triaxetat cho phép thu được sản phẩm chủ yếu là lacton. …”
Get full text

Scale-free fault-tolerant topology control algorithm in wireless sensor network with optimization of path energy consumption by Hao-ran LIU, Tao HAN, Ya-qian LI, Rong-rong YIN

“…For the issue of path energy consumption produced in the process of transmitting data in large-scale sensor network, an optimization model of network path energy consumption based on the mode of multi-hop was established, and then the law of obtaining the value of the node degree that could minimize the energy consumption of network was deduced. …”
Get full text

NGHIÊN CỨU PHƯƠNG PHÁP PHÂN LẬP TANSHINONE IIA TỪ ĐAN SÂM LÀM CHẤT ĐỐI CHIẾU by Trịnh Thị Điệp, Trần Thanh Hà

“…Phương pháp phân lập gồm các bước: chiết các thành phần thân dầu từ rễ đan sâm bằng n-hexan, phân lập tanshinone IIA bằng sắc ký cột silicagel và tinh chế bằng phương pháp kết tinh lại. Cấu trúc hóa học của hợp chất này được khẳng định bằng các phổ IR, NMR và MS. …”
Get full text

Del papel en blanco y negro al Do it yourself digital. La evolución de la prensa graffitera en Madrid by Celeste Martín-Juan

“…This scene of muralism in Madrid, linked to Hip Hop culture as its branch of aesthetic expression, serves as a case study to observe the evolution of the Spanish specialized press: from the beginnings of the photocopied fanzine; going through the press of specialized stores; until the moment it hits the newsstands; and, finally, the impact of new digital formats.…”
Get full text

Energy-Aware Distributed Intelligent Data Gathering Algorithm in Wireless Sensor Networks by Rongbo Zhu, Yingying Qin, Jiangqing Wang

“…Compared with existed algorithms, detailed simulation results show that the proposed DIDGA can reduce average hop counts, average data gathering time, energy consumption, increase the efficiency of event detection ratio and prolong the network lifetime.…”
Get full text

Research of Multidimensional Optimization of LEACH Protocol Based on Reducing Network Energy Consumption by Chunhua Lin, Feng Jiang

“…In the multihop communication between clusters, in order to calculate the fitting factor of the next hop, we derived a new formula, which takes into account the angle, remaining energy, and distance. …”
Get full text

A distributed data secure transmission scheme in wireless sensor network by Wei Liang, Yin Huang, Jianbo Xu, Songyou Xie

“…Therefore, it is difficult to ensure security of broadcasting data transferred from a single wireless sensor node to base station. Multi-hop transmission of data between sensor nodes wastes network resource. …”
Get full text

Individual Channel Estimation in a Diamond Relay Network Using Relay-Assisted Training by Xianwen He, Gaoqi Dou, Jun Gao

“…The principal challenge is to obtain accurate channel state information (CSI) of second-hop link due to the multiaccess interference (MAI) and cooperative data interference (CDI). …”
Get full text

African American Street Lit’: old, new, or better (?) tricks? by Cécile Cottenet

“…Emerging in the mid-1990s, Street lit’, or hip-hop literature undeniably contributed to the boom in African American fiction of the late 20th century. …”
Get full text

Performance Analysis in the Decode-and-Forward Full-Duplex Relaying Network with SWIPT by Phu Tran Tin, Phan Van-Duc, Tan N. Nguyen, Le Anh Vu

“…Besides, we consider both direct and two-hop relaying links to transmit data from the source to the destination. …”
Get full text

Analysis for rank distribution of BATS codes under time-variant channels by Shiheng WANG, Heng LIU, Lin TANG, Jinling SU, Ruiqi ZHANG

“…As a two-step coding technique applied in multi-hop networks with a low complexity, the transmission performance of batched sparse (BATS) code was directly related to the rank distribution of the transfer matrix.Based on the assumption that the packet loss rate of each link on the erasure channel was constant, the rank distribution of the batch sparse codes on the erasure correction channel had been widely studied.However, in some scenarios such as the industrial Internet, a large number of mobile nodes were deployed in the whole network, which may cause the channels among nodes to become time-varying, that was, the packet loss rate on the link may vary with time.Therefore, under the assumption that the link packet loss rate between nodes in the network changes randomly, the rank distribution of batched sparse code transmission matrix was studied when random linear network coding (RLNC) and system recoding were used as inner coding schemes, and the closed solution of normalized rank expectation was deduced when the link packet loss rate obeyed the finite interval normal distribution.The correctness of the closed solutions was verified by Monte Carlo simulation.…”
Get full text

Research on Lifetime Optimization Algorithm for Mobile Wireless Sensor Network by Zhangquan Wang, Yourong Chen, Tiaojuan Ren, Sen Xu

“…When the position of sink node is fixed,the sensor nodes which are distributed around the sink node easily become hub nodes,forward a lot of data and fail prematurely.In order to solve this problem,the lifetime optimization algorithm for mobile wireless sensor network（LOAMWSN）was proposed.LOAMWSN algorithm considers the mobility of sink node,uses subtractive cluster algorithm to determine mobile anchor points of sink node,uses the nearest neighbor interpolation method to find the approximate solution of shortest route which traverse all mobile anchor points,uses distributed asynchronous Bellman-Ford algorithm to construct the shortest path tree in the k-hop range of sink node.Finally,sensor nodes transmit data to sink node along the shortest path tree.Simulation results show that in wireless sensor network of node uniform distribution and non-uniform distribution,LOAMWSN algorithm can prolong the network lifetime,balance the node energy consumption,and remain the average node energy consumption at a low level.Under certain conditions,it outperforms Ratio_w and TPGF algorithms.…”
Get full text

A Novel Decentralized Scheme for Cooperative Compressed Spectrum Sensing in Distributed Networks by Huang Jijun, Zha Song

“…Considering limited communication resources per CR, a decentralized implementation based on alternating direction method of multipliers is presented to calculate the Karcher mean via one-hop communications only. The superior performance of the proposed scheme is demonstrated by comparing with several existing decentralized schemes in terms of detection performance, communication overhead, and computational complexity.…”
Get full text

Routing algorithm for supporting data-differentiated service in hybrid wireless mesh networks in underground mines by Haifeng Jiang, Liansheng Lu, Guangzhi Han, He Wang, Shanshan Ma, Renke Sun

“…Based on network parameters, the hybrid wireless mesh networks are abstracted as potential fields. The hop count is used to build the depth potential field. …”
Get full text

An active detection of compromised nodes based on en-route trap in wireless sensor network by Jiang-Tao Wang, Zhi-Xiong Liu

“…Most of current en-route filtering schemes could filter false data effectively; however, the compromised nodes could take use of the filtering scheme to launch Fictitious False data Dropping attack, the detection of this attack is extremely difficult since the previous hop node is unable to distinguish whether the forwarding node dropt a false data report with incorrect Message Authentication Codes or a legitimate report. …”
Get full text

Opportunistic routing algorithm based on trust model for ad hoc network by Bo WANG, Xun-xun CHEN

“…Due to the absence of enough physical protection,dynamic topology,distributed collaboration,the limited bandwidth and computing ability in ad hoc network,traditional routing security mechanism cannot adapt to the design of routing protocols.Recently,opportunistic routing is of the research hotspots,which can cope with the unreliable transmissions to improve throughput of the whole network by exploiting the broadcast nature of the wireless medium and spatial diversity of multi-hop wireless network.The concept of trust-based similarity in opportunistic routing for ad hoc network was incorporated,and a novel trusted opportunistic forwarding model based on trust degree of node and least cost of opportunistic routing were also built.Then a trusted minimum cost routing algorithm (MCOR) was proposed and the correctness and effectiveness of this algorithm from theoretical ana ysis were proved.Finally,MCOR algorithm was verified by simulation and was compared with the classic protocols:ExOR,TAODV and Watchdog-DSR.The simulation results show that MCOR scheme can detect and mitigate node misbehaviors.Furthermore,MCOR scheme outperforms the other protocols in terms of throughput,delay,expected ETX and cost of routing.…”
Get full text