This paper applies spectral efciency as a performance measure for routing schemes and considers how to obtain a good route in a wireless network. The objective for this study is to combine different perspectives from networking and information theory in the design of routing schemes. The problem of nding the optimum route with the maximum spectral efciency is difcult to solve in a distribut...

| A loop-free path-nding algorithm (LPA) is presented ; this is the rst routing algorithm that eliminates the formation of temporary routing loops without the need for internodal synchronization spanning multiple hops or the speciication of complete or variable-size path information. Like other previous algorithms, LPA operates by specifying the second-to-last hop and distance to each destinati...

In wireless sensor network to make reliable path connectivity and packet exchange will take more time and also need more power. Two techniques are analysed here to reduce time and maintain power consumption. One of the techniques is Continuous Neighbor Discovery, It will find neighbor node and also continuously maintain a immediate neighbour node view. Another one is Link Assessment Method, It ...

Zigbee Tree Routing, which doesn't need any routing table/route discovery overhead is used in several resource limited devices and applications. ZTR has a basic limitation regarding providing of optimal routing path as it follows tree topology, hence an optimal routing path can't be achieved. In this paper, we proposed a protocol stated as Shortcut Tree Routing (STR) similar to ZTR&ap...

Multi-Output Dependence (MOD) learning is a generalization of standard classification problems that allows for multiple outputs that are dependent on each other. A primary issue that arises in the context of MOD learning is that for any given input pattern there can be multiple correct output patterns. This changes the learning task from function approximation to relation approximation. Previou...

Some modified two-slit interference experiments were carried out showing an apparent paradox in wave–particle duality. In a typical such experiment, the screen, where pattern is supposed to be formed, replaced by converging lens. The lens forms images of two slits at spatially separated detectors. It was claimed that each these detectors give information about which slit photon came from, even ...

A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In this paper we present conjectures for the scaling limit of the uniform measures on these objects. The conjectures are based on recent results on the stochastic Loewner evolution and nondisconnecting...