Sharif Digital Repository

In this paper, we propose a novel algorithm for rate allocation in multiple-source media streaming peer to peer networks. Our algorithm is based on ant-colony optimization and capable of handling network changes which occur quite often in unstructured P2P networks. The suggested algorithm does not need any information about the topology of the network. Moreover, it could get over uncertainties in network state information, particularly the rate of media provider nodes that could happen due to lack of accurate measurements. We show that our algorithm will reach the maximum achievable rate of the network quite fast and with relatively little overhead. In our simulations, we have demonstrated... 

Flooding and its variants are the simplest and most widely used broadcasting methods. Therefore, analysis of its performance in an ad-hoc environment using realistic assumptions is an important research topic. In this article, deploying a rigorous theoretic analysis, an upper bound on the performance of probabilistic flooding running over CSMA as a real and suitable MAC layer protocol for broadcasting scenarios is derived in a static multi-hop ad-hoc network in saturated condition. This model reveals the relation between network parameters and the performance of flooding and thus, helps the designer to have a better understanding of the effect of different design parameters. Using this... 

In this paper we discuss and analyze an enhanced media access control (MAC) layer protocol which uses the signaling method benefits of physical layer in order to provide different quality of service (QoS) levels in optical code-division multiple-access (OCDMA) packet networks. In the proposed network architecture the users are categorized into the high and low classes of service. Users of each class transmit at the same power level and different from the other classes' users. Also, the MAC of each user estimates the amount of interference on the channel and adjusts the packet transmission's time to improve network performance. Through simulation it is shown that the combination of... 

In this paper we will propose a novel distributed architecture for overlay tree construction in collaborative virtual environments that is unlimitedly scalable due to its fully decentralized nature. The routing issue over this architecture will later be discussed and several forwarding schemes based on distributed hash tables (DHT) will be proposed. One of the main concerns for a routing algorithm is to keep a trade-off between the algorithm locality and the algorithm performance. In a global algorithm where nodes make the forwarding decision based on the information gathered from all other nodes in the network, the routing performance may obviously be better. However such a large group... 

Although collaborative distributed simulations and virtual environments (VE) have been an active area of research in the past few years, they have recently gained even more attention due to the emergence of online gaming, emergency simulation and planning systems, and disaster management applications. Such environments combine graphics, haptics, animations and networking to create interactive multimodal worlds that allows participants to collaborate in real-time. Massively Multiplayer Online Gaming (MMOG), perhaps the most widely deployed practical application of distributed virtual environments, allows players to act together concurrently in a virtual world over the Internet. IP... 

Adaptive modulation with the goal of minimizing the average transmit power is investigated. This is the dual problem of the well-known problem of maximizing the average spectral efficiency. This is desirable in power limited systems such as mobile and sensor networks. Two main cases are considered: adapting only transmit power and adapting only rate. Appropriate expressions for rate or power control policies are derived for different cases. For rate adaptation, we consider both continuous and discrete rate policies. Then, we will apply these methods to a special case of M-QAM modulation over Rayleigh fading channel. We will show that by using rate or power adaptation schemes, between 7dB and... 

In a SEnsor Network with Mobile Agents (SENMA) is an architecture proposed for large scale sensor networks. In sensor networks, a fraction of the packets generated by only part of the sensors is sufficient to provide a good estimation of all network information. SENMA uses this inherent redundancy. However, the performance of such system is limited by estimation errors and packet errors due to collision. Estimation error is a major problem in applications such as habitat monitoring in which information is a function of node position. In this paper, we first derive the equations of distortion in a general scenario and use this model to compare the estimation error for regular networks. Then... 

Adaptive transmission is an effective way to improve the performance of communication links in time-varying channel environments. Former works use this technique to maximize the throughput; but we exploit it to minimize BER in a system with diversity reception. We do so by adapting power in response to the channel variations. We use analytical methods to derive our results. These expressions can be used for any type of channel fading and any modulation scheme. We then apply this method to a special case of 4-QAM over Rayleigh channel with MRC reception. Copyright 2005 ACM  

Most of the energy efficient routing algorithms proposed for sensor networks are reactive routing algorithms. By definition, reactive algorithms are those in which routes are constructed whenever there is data transmission. In such algorithms, to transmit data packets from a certain transmitter to the corresponding receiver, efficient route will be constructed using RREQ delivery. This delivery is performed via flooding and modified flooding algorithms. One of the most important criteria of such flooding algorithm is not to miss the best final route during RREQ delivery. Most of major algorithms ignored this fact and instead tried to minimize energy consumption during flooding algorithm. But... 

Online games seem to become major contributors to Internet traffic. Therefore a great deal of effort is being devoted to the analysis and modeling of network game traffic. However the results from the previous measurements have not been unified into a single frame work while gaming traffic model is of high importance to network designers. Considering the fact that Gaming traffic is generated by the player's interaction during game sessions, we propose to model the player's activities and later use this model to extract the traffic pattern. We will propose a model for the gaming player behavior regarding traffic generation based on hierarchical hidden markov model. Player activities are... 

This paper proposes a new medium-access control (MAC) protocol designed for wireless sensor networks. A wireless sensor network is an array of large number of sensors interconnected by a multi-hop ad-hoc network. The primary objective for the sensor network is achieving to low-power consumption while latency is usually less important compare to traditional wireless networks. This characteristic of sensor network motivates the design of new MAC layer so that power consumption is reduced. In this paper, a novel traffic-aware algorithm based on distributed node schedule management (DMD) protocol is introduced that utilizes distributed dynamic node scheduling strategy to dramatically increase... 

Time domain equalizers are used in the receiver of a discrete multitone (DMT) receiver to compensate the channel effects on the received signal. There are a lot of DMT equalization algorithms presented in the literature, but recently a novel Per Tone equalizer structure was proposed which offers some advantages over the previous traditional ones. The objective of this paper is to provide an overview of the important concepts of this technique and evaluate its initialization complexity. The performance of this technique is also compared with typical time-domain equalization algorithms in different simulation environments. © 2004IEEE  

There has been an increasing demand for interactive video transmission over the Internet for applications such as video conferencing, video calls, and telepresence applications. These applications are increasingly moving towards providing High Definition (HD) video quality to users. A key challenge in these applications is to preserve the quality of video when it is transported over best-effort networks that do not guarantee lossless transport of video packets. In such conditions, it is important to protect the transmitted video by using intelligent and adaptive protection schemes. Applications such as HD video conferencing require live interaction among participants, which limits the... 

In this paper, we study two important transmission strategies in full-duplex two-way relaying in the presence of channel estimation errors. In analog network coding (ANC), the relay transmits the combined signals that were received from both sources, with the aim of achieving better spectral efficiency. However, due to imperfect channel-state information (CSI), sources cannot perfectly cancel their own data in the relayed signal. We derive an achievable information rate for ANC in imperfect-CSI conditions and show how the ANC performance can significantly be degraded as a result. Moreover, we derive cut-set bounds with channel estimation errors for traditional routing (TR), in which time... 

Security techniques have been designed to obtain certain objectives. One of the most important objectives all security mechanisms try to achieve is the availability, which insures that network services are available to various entities in the network when required. But there has not been any certain parameter to measure this objective in network. In this paper we consider availability as a security parameter in ad-hoc networks. However this parameter can be used in other networks as well. We also present the connectivity coefficient of nodes in a network which shows how important is a node in a network and how much damage is caused if a certain node is compromised  

Performance of routing is severely degraded when misbehaving nodes drop packets instead of properly forwarding them. In this paper, we propose a Game-Theoretic Adaptive Multipath Routing (GTAMR) protocol to detect and punish selfish or malicious nodes which try to drop information packets in routing phase and defend against collaborative attacks in which nodes try to disrupt communication or save their power. Our proposed algorithm outranks previous schemes because it is resilient against attacks in which more than one node coordinate their misbehavior and can be used in networks which wireless nodes use directional antennas. We then propose a game theoretic strategy, ERTFT, for nodes to... 

Locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs is proposed in this paper. LMAR can find an ad-hoc path without selfish nodes and wormholes using a random search algorithm in polynomial-time. Also when the primary path fails, it discovers an alternative safe path if network graph remains connected after eliminating selfish/malicious nodes. The main feature of LMAR to seek safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is equiloaded compared to single-path routing protocols but its ability to bypass the attacks is much better... 

Counter-based broadcasting improves the performance of flooding by preventing the network from being swamped by a large number of rebroadcast messages. In such approach, the rebroadcast decision is made based on counting duplicated packets in order to restrict the number of extra retransmissions. In this article, using a rigorous theoretic analysis, an upper bound on the performance of counter-based broadcasting for saturated networks is derived. Our model assumes a CSMA-based static multi-hop ad-hoc network. The derived analytical model can be used to predict the behavior of counter-based broadcasting schemes. It especially provides the required insight on the impact of different network... 

Development of Smart Grid and deployment of smart meters in large scale has raised a lot of concerns regarding customers’ privacy. Consequently, several schemes have been proposed to overcome the above mentioned issue. These schemes mainly rely on data aggregation as a method of protecting users’ privacy from the grid operators. However, the main problem with most of these schemes is the fact that they require a large amount of processing power at the meter side. This, together with the fact that smart meters don't usually have a powerful processor, can cause the unavailability of smart meter data at the required time for operators of the grid, and at the same time prevents smart meters from... 

The demands for carrying data traffic in long distances have been increasing rapidly and Service providers encounter the challenging issue of the best approach for handling the high volumes of Ethernet traffic generated by the proliferation of network access applications. The next generation SONET/SDH solutions offer integration of several functionalities into a single network element, thus reducing the power and space requirements as well as facilitating the configuration and management of the network. They are expected to continuously support TDM services, while enabling carriers to offer new Ethernet-based data services. Therefore Ethernet over SDH standard that enables legacy SDH/SONET...