The wireless sensor network is a wireless network of self-organized sensors that are distributed at intervals. These sensors are used to group measurements of specific physical quantities or environmental conditions such as temperature, sound, vibration, pressure, motion, or pollutants at various locations. Energy efficiency to extend a wireless sensor network's lifetime should be considered in all network design areas, including hardware and software. Wireless sensor networks may be used in critical applications and transmit sensitive data, so they need Methods to Secure the data. Secure routing in wireless sensor networks is vital due to the need for data confidentiality, integrity, energy efficiency, authentication, and resilience against attacks. It ensures sensitive data remains private, prevents tampering, optimizes energy usage, verifies node authenticity, and defends against attacks. This paper presents a Secure routing Method in wireless sensor networks. In the proposed Method, due to the nodes' processing limitations and to ensure the security of the exchanged messages, the lightweight columnar transposition cipher Method is used. The routing process is done hop by hop, and the next hop is selected based on the parameters of remaining energy, distance to the base station, and node traffic. The proposed routing Method is implemented by MATLAB and compared with SMEER and KID-SASR Methods. The simulation results show a reduction of end-to-end delay of 50% and 38%, reduction of energy consumption of 39% and 20%, reduction of packet loss rate, and increased number of live nodes by 66% and 59% compared to SMEER and KID-SASR.

In the network steganography Methods based on packet length, the length of the packets is used as a carrier for exchanging secret messages. Existing Methods in this area are vulnerable to detections due to abnormal network traffic behaviors. The main goal of this paper is to propose a Method which has great resistance to network traffic detections. In the first proposed Method, the sender embeds a bit of data in each pair that includes two non-identical packet lengths. In the current situation, if the first packet length of the pair is larger than the second one, it shows a ‘ 1’ bit, and otherwise, it shows a ‘ 0’ bit. If the intended bit of the sender is in conflict with the current status, he/she will create the desired status by swapping the packet lengths. In this Method, the paired packets can be selected freely, but in the second proposed Method, the packets are divided into buckets, and only packets within a single bucket can be paired together. In this case, the embedding Method is similar to the previous one. The results show that the second Method, despite having low embedding capacity, will be more Secure in real traffic compared to the other Methods. Since the packet lengths of UDP protocol are more random in comparison to TCP, the proposed Methods have higher embedding capacity, and they are more Secure for UDP-based packets. However, these Methods are only applicable to the protocols in which the packet length has not a constant value.

The transformation technique relies on the comparison of parity values computed in two ways. The fault detection structures are developed and they not only detected subsystem faults but also corrected faults introduced in the data processing system. Concurrent parity values techniques are very useful in detecting numerical error in the data processing operations, where a single fault can propagate to many output faults. Parity values are the most effective tools used to detect faults occurring in the code stream. In this paper, we present a Methodology for redundant systems that allows to detect faults. Check pointing is the typical technique to tolerate such faults. This paper presents a check pointing approach to operate on encoded data. The advantage of this Method is that it is able to achieve very low overhead according to the specific characteristic of an application. The numerical results of the multiple check pointing technique confirm that the technique is more efficient and reliable by not only distributing the process of check pointing over groups of processors. This technique has been shown to improve both the reliability of the computation and the performance of the check pointing.

One of the important requirements of sensor networks is synchronization of the nodes. The importance of time in sensor networks causes the adversary tries to disturb time synchronization by altering and faking messages, delaying or replying them, compromising the nodes and sending false messages via them. Up to now, there is no Method that is able to provide both synchronization and security needs of sensor networks simultaneously. In this paper, we suggest a Method that is capable to provide precise synchronization, along with low communication and computational overhead, low convergence time and high security against internal and external attacks. Simulation and analytic results show the preference of our Method compared to other available Methods.

Recently, an innovative voting Method named quadratic voting (QV ) has been proposed which allows people to vote as much as they want, according to their preferences intensity. Little research has been done on the safe implementation of this Method. In this paper, we first present a voting Method based on QV . This Method combines the voting and planning, and gives the ability to voters to express their opinions about the candidates programs in addition to voting. Then, a Secure electronic voting protocol is proposed for implementing our Method. This protocol gives the voters to check the verifiability of ballots and the safety of payment so that they would be sure that their votes are counted correctly.

This paper presents an innovative technique on the application of chaotic systems for Secure communication. The inherent defect of shortage of chaotic bandwidths has been remedied by employing spread spectrum nonlinear functions and the information signal is masked with chaos based spread spectrum signal with high security. The designing state observer along with nonlinear output feedback control is the basis of the receiver structure. Lyapunov stability theory guarantees the synchronization of slave system with the master chaos driver. Meanwhile, duo to noisy communication channel, a stochastic ITO model for master system is supposed to design the state observer. The receiver extracts the information signal using the transmitted signal and the outputs of the observer. The results of numerical simulations based on the Chua circuit fully elaborate the proposed Method.

The occurrence of any earthquakes, small or large, in the country may draw the attention of authoritThe occurrence of any earthquakes, small or large, in the country may draw the attention of authorities to the extent of Tehran’ s vulnerability for a while. More than three million people living in Tehran suffer from unstable housing. On the one side, Tehran is located between three active faults that earthquakes on a high Mercalli intensity scale would seriously threaten the shelters and lives of citizens. The crisis caused by high population density and poor crisis management may lead to a severe catastrophe. On the other side, based on Iran’ s Supreme Council of Urban Planning and Architecture definition of urban deteriorated areas characterized by fineness modulus, instability, and impermeability, about 80% of unstable zones (areas) have been ignored. Furthermore, in such areas the peoples’ lives have been threatened severely living less chance for life-saving plans. However, regarding the priority of the peoples’ “ life” issue, rescuing peoples’ life should not be ignored for the sake of other design attributes. Therefore, the municipality and central government must seek a realistic solution to rescue residents of urban deteriorate areas in Tehran. The present study introduces the concept of “ neighborhood Secure focal point” as activation for renovating urban deteriorated areas and focuses on removing initial obstacles to modernization (the need to provide parking), and the emergency of incentives management (granting density, increased building area, and downsizing) as the major drivers. This study argues that any intervention for urban deteriorated areas renovation should offer improved quality of social life, developed participation, and a prosperous urban economy by tracing urban management solutions, in addition to taking account of economic benefits for owners.