The 14th edition of International Telecommunications Network Strategy and Planning Symposium (shortly: Networks 2010) held in Warsaw, Poland. Networks 2010 was a four-day professional and scientific event organized by Warsaw University of Technology in co-operation with Polish Association of Telecommunication Engineers (SIT). The conference was focused on network design and planning methods inc...

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

Abstract We suggest a framework that models the universe as Telecommunication Network, with several layers of abstraction, characteristic protocols and encoding schemes. first define fundamental network atoms space ( Present foliation ) toy model most elementary abstraction on spacetime. describe protocol to encode information distance, non-locality, entanglement among these nodes. In this fram...

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

Today, one of the new technologies in the modern era is Vehicular Ad-hoc Network which has takenenormous attention in the recent years. Because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called V2V orvehicle to vehicle communication and vehicle to roadside infrastructure, called V2I. Designin...

Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems. This paper presents some experiments of applying SA to an NP-hard problem, i.e., call routing in circuit-switched telecommunications networks. The call routing problem considered here can be described as assigning calls to paths in a network so that the number of calls blocked can be minim...

mobile ad hoc networks (manets) are composed of mobile stations communicating through wireless links, without any fixed backbone support. in these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. tora is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it doesn’...