wireless sensor network includes a large number of nodes which are distributed in a geographical location. the essential fact about wsn is that energy of nodes is limited. therefore, presenting proper solutions as an optimized routing is crucial to equally use energy of all nodes. in this paper we propose a method which performs routing in wsns using greedy approach. it is able to choose optimu...

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...

Source location privacy is becoming an increasingly important property of some wireless sensor network applications. The fake source technique has been proposed as an approach for handling the source location privacy problem in these situations. However, whilst the efficiency of the fake source techniques is well documented, there are several factors that limit the usefulness of current results...

An idea for enabling all-optical packet switched networks is to use deflection routing together with erasure recovery coding at the packet level. Deflection routing has been generally considered in the past only in highly structured networks. The purpose of this paper is to report results of a simulation experiment to evaluate several topology-based routing algorithms for deflection routing in ...

Packet routing is an important problem of parallel computing since a fast algorithm for packet routing will imply 1) fast inter-processor communication, and 2) fast algorithms for emulating ideal models like PRAMs on fixed connection machines.There are three different models of packet routing, namely 1) Store and forward, 2) Multipacket, and 3) Cut through. In this paper we provide a survey of ...

Secure communication is a critical and challenging issue in wireless networks. To achieve the information theoretic secrecy the leading approach is artificial noisy symbol. The basic idea in this paper is enhancing the security in wireless communication. Multiple Inter-symbol Obfuscation(MIO) method will be deployed in the physical layer. MIO is a method for transferring the data and it provide...

simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. in this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of fdma based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with fuzzy distributed h∞ control strategy ....