Node selection in p2 p content sharing service in mobile cellular networks with reduction bandwidth
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 52Node Selection in P2P Content Sharing Service in MobileCellular Networks with Reduction BandwidthS.Uvaraj1, S.Suresh 21M.E/CSE, Arulmigu Meenakshi Amman College of Engineering,Kanchipuram, India.email@example.comB.Tech/IT, Sri Venkateswara College of Engineering,Chennai, India.firstname.lastname@example.orgAbstract: The peer-to-peer service has entered the public limelight over the last few years. Several research projectsare underway on peer-to-peer technologies, but no definitive conclusion is currently available. Co mparingto traditional server-client technology on the internet, the P2P technology has capabilities to realize highlyscalable, extensible and efficient distributed applications. At the same time mobile networks such as WAP, wirelessLAN and Bluetooth have been developing at breakneck speed. Demand for using peer-to-peer applications over PDAsand cellular phones is increasing. The purpose of this study is to explore a mobile peer-to-peer network architecturewhere a variety of devices communications each other over a variety of networks. Mobility in Peer-to-Peer (P2P)networking has become a popular research area in recent years. One of the new ideas has been how P2P would suit forcellular networks. In this case, Mobile Peer-to-Peer (MP2P) presents not only technical but also business and legalchallenges.we propose the architecture well-adapted to mobile devices and mobile network. In P2P content sharingservice in mobile cellular networks, the bottleneck of file transfer speed is usually the downlink bandwidth of the receiverrather than the uplink bandwidth of the senders. In this paper we consider the impact of reduction bandwidth on file transferspeed and propose two novel peer selection algorithms named DBaT-B and DBaT-N, which are designed for two differentcases of the requesting peer’s demand respectively. Our algorithms take the requesting peer’s reduction bandwidth as thetarget of the sum of the selected peers’ uplink bandwidth. To ensure load balance on cells, they will first choose a cell wit hthe lowest traffic load before choosing each peer.Keywords -Network Security; P2P; mobile cellular networks; peer selection; load balance; downlink bandwidth limitation.1. INTRODUCTIONIn the cooperated network, the server-client technologyhas been used as the traditional way to handle networkresources and provide Internet services. It has advantagesto regulate Internet services by only maintain limitednumber of central servers. As a result, peer-to-peertechnology has become popular and has been used innetworks which manage vast amounts of data daily, andbalance the load over a large number of servers.At the same time, mobile Internet services have becomevery popular. In the past four years, the market of mobileInternet services has considerably grown successful inJapan where imode is the most famous example. Themobile environment is different from the fixed Internetin that it is an extremely constrained environment, interms of both communication and terminal capabilities.This should be taken into account when developingsystems which will work in a mobile environment.Additionally, various wireless have been emerging ofnetwork environments such as IMT-2000 (InternationalMobile Telecommunications-2000, for example FOMA),Wireless LAN and Bluetooth, and users can select themto satisfy their network demands. In the near future, anenvironment where many sensors, users and differentkind of objects exist, move and communicate with oneanother, called “ubiquitous communicationenvironment”, will appear.In this paper we study the problems of peer selection inP2P file sharing systems over mobile cellular networkswith consideration of downlink bandwidth limitation.Our motivation is that, since the file transfer speed islimited by the requesting peer’s downlink bandwidth,some other performance indicator such as load balanceon cells should be focused on. So our goal is to achieve
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 53load balance on cells under the precondition that therequesting peer’s demand is satisfied. In P2P file sharingsystems the requesting peer’s demand can be dividedinto two cases, one is that the requesting peer demands alower bound of the sum of the selected peers’ uplinkbandwidth (as in some P2P media sharing systems ),and the other is that the requesting peer demands acertain number of selected peers (denoted as Num wantin Bit Torrent Tracker protocol ). We consider the twocases both and propose two algorithms for the two casesrespectively. The first one is named DBaT-B (DownlinkBandwidth as Target, Bandwidth satisfied), and thesecond one is named DBaT-N (Downlink Bandwidth asTarget, Number satisfied). Major features of ouralgorithms can be described as follows. First, they takethe requesting peer’s downlink bandwidth as the target ofthe sum of the selected peers’ uplink bandwidth. Second,they choose a cell with the lowest traffic load beforechoosing each peer. Difference of the two algorithms liesin using different criteria in each peer selection round tosatisfy the different demand. Moreover, we also providea Fuzzy Cognitive Map (FCM)  that can be used inour algorithms to estimate peers’ service abilityaccording to multiple influential factors. Simulationresults show that in respective cases DBaT-B and DBaT-N algorithms can both achieve favorable load balance oncells in mobile cellular networks while ensuring goodfile transfer speed, and compared with other twotraditional peer selection algorithms our algorithms arenice improvements.The principal goal of our work is thus to design a mobilepeer-to-peer architecture and a general peer-to-peerplatform that enhances communication capabilities formobile clients, by utilizing network resources efficientlyand supporting mobility in an integrated and practicalway.The rest of this paper is organized as follows. Section 2gives an overview of our peer-to-peer architecture,describes each key element of our architecture andmobile device adaptation. Section 3 describes theAlgorithm design. We introduce DBAT-B and DBAT-Nalgorithms in detail. Section 4 we present the FCM thatcan be used in our algorithms. In Section 5 we evaluatethe performance of our algorithms through simulations.Finally we give out conclusions for this paper.2. ARCHITECTUREA. Architecture overviewThe proposed mobile peer-to-peer architecture is shownin Fig. 1. All of the peer-to-peer communication entitiesthat have a common set of interest and obey a commonset of policies construct one peer-to-peer community.This architecture consists of the following basiccomponents:Peer-to-peer node: The peer-to-peer node is anindependent communication entity in the peer-to-peernetwork.Mobile proxy: Theoretically, all the mobile devices (e.g.WAP or i-mode terminals) can be independent nodes inthe peer-to peer architecture. However some of them arefunctionally limited and cannot act as autonomous nodes.The mobile proxy is a function in a node, which acts as aproxy for the mobile devices with constrained capability,so that these mobile devices can join the peer-to-peerarchitecture.Pure peer-to-peer architecture: There are only peer-to-peer nodes in the pure peer-to-peer architecture. Theproposed pure peer-to-peer architecture is shown in Fig.2 (a). The connection between peer-to-peer nodes isestablished on their mutual trust. Each peer-to-peer nodeis an independent entity and can participate in and leavethe peer-to-peer network at its convenience. Messagesare sent from a peer-to-peer node to another one directlyor by passing them via some intermediary peer-to-peernodes.
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 54Hybrid peer-to-peer architecture: The hybrid peer-to-peer architecture resolves the disadvantages of the purepeer-to-peer architecture such as inefficient routing,splits of network and lack of security, by introducing acontrol node. The proposed hybrid peer-to-peerarchitecture is shown Fig. 2 (b). In our architecture, thecontrol node provides the functions for providing routinginformation to a destination node, discovering the firstpeer-to-peer node, recovering from the splitting of thepeer-to-peer network, improving the network topologyand security such as authentication, in order to improvethe inefficiency of the pure peer-to-peer architecture. Torealize the hybrid peer-to-peer architecture, the controlnode and the gateway node are defined.Control node: Control node is an administrative entitywhich manages a peer-to-peer community in the peer-to-peer network. It provides several functions independentof particular applications such as name resolution, routeinformation provision, the first per-to-peer discovery,network topology optimization, node authentication andmulticast group management.Gateway node: Gateway node is a connection entitylinking between a pure peer-to-peer network and ahybrid peer-to-peer network. It provides for nodes inpure peer-to-peer network with several proxy functionssuch as routing information provision, nodeauthentication, and multicast group management. Acontrol node receives a request from a peer-to-peer nodeand provides it with routing information, topologyoptimization function and security function. A gatewaynode collects topology information on a pure peer-to-peer network and reports it to the control node.B. Mobile Device AdaptationAnother distinct characteristic of this architecture is thatit allows mobile devices to take part in the peer-to-peernetwork via a mobile proxy node. While a mobiledevice, such as a cellular phone, may have enoughcapabilities to act as an independent peer-to-peer node inthe future, it still has the following limitations at thistime:• Limited storage• Small runtime heap• Modest processor performance• Constrained electrical powerThus, a current mobile device can’t fully perform therole of a peer-to-peer node that offers services to otherpeer-to-peer nodes in a peer-to-peer network. In order toincorporate a mobile device into a peer-to-peer network,some functions must be done by other nodes on behalf ofa mobile device. Through the cooperation of a mobileproxy, a mobile device can virtually act as a peer-to-peernode and can perform the necessary functions in thepeer-to-peer architecture. From the point of view of thepeer-to-peer architecture, mobile devices are modeled inthe three ways.In Fig.3 (a), mobile devices share the same proxy node.From the point of view of the network, the mobile proxyacts as one peer-to-peer node. In Fig. 3(b), a mobiledevice has its own node name and acts as a separatepeer-to-peer node in the peer-to-peer architecture.Figure 3: Mobile Device AdaptationFor realizing this type of mobile proxy, some proxyfunctions should be implemented on Node C such astransforming a message received from a mobile deviceinto a message of a peer-to-peer protocol. In Fig. 3(c), apair of a mobile device and a proxy function constructs apeer-to-peer node in the peer-to-peer architecture. In thiscase, a mobile device has its own node name, and acts asa separate node through a mobile proxy. The mobileproxy does not act as an independent node. It will bedecided by requirements of peer- to- peer applications, asto which type of mobile proxy model will be preferable.
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 553. DBAT ALGORITHMSIn this section we depict the details about DBaT-B andDBaT-N algorithms, which can be denoted as DBaTalgorithms as a whole. Due to the existence of downlinkbandwidth limitation, it is unnecessary to always choosepeers with high uplink bandwidth. So DBaT algorithmstake the requesting peer’s downlink bandwidth as thetarget of the sum of the selected peers’ uplink bandwidth.Besides, to ensure load balance on cells, DBaTalgorithms will first choose a cell with the lowest trafficload before choosing a peer.In DBaT algorithms service ability is used as one of thecriteria for peer selection. As we have mentioned before,in mobile environments estimation of peers’ serviceability is complicated since it is influenced by multiplefactors. In this section we just focus on the details ofDBaT algorithms. A method about how to estimatepeers’ service ability in P2P file sharing systems overmobile cellular networks will be provided in nextsection. Here we list the common notations used in thissection and their meanings:The traffic load on a cell is defined as the ratio of thecurrent used radio bandwidth over the total radiobandwidth of the base station in the cell. For example,assuming that the current used radio bandwidth of a 3Gbase station is 1.2Mbps, the traffic load on this cell is 0.6since the maximum radio bandwidth provided by this 3Gbase station is 2Mbps.Obviously the value of traffic loadon a cell ranges from 0 to 1.3.1 DBAT-B ALGORITHMDBaT-B algorithm is designed for the case that therequesting peer demands a lower bound (denoted as Bd)of the sum of the selected peers’ uplink bandwidth. Therelationship between Bd and Br can be discussed asfollows. On one hand, if Bd is higher than Br, it makesno sense due to the performance limitation imposed byBr. On the other hand, if Bd is lower thanBr, we can easily take Bd as Br and DBaT-B algorithmstill works. Here we list the notations used in thissubsection and their meanings:• Bs: Sum of the estimated uplink bandwidth of theselected peers. Initial value of Bs is 0.• ΔB: Difference between Br and Bs, more specifically,ΔB = Bs – Br.In more detail, DBaT-B algorithm works in thefollowing steps:Step 1. Choose a cell:1-1. Sort the cells according to the traffic load;1-2. Choose a cell with the lowest traffic load, go to Step2.Step 2. Check all the peers in this cell with Bpa and |ΔB|:2-1. Compare the values of Bpa of all the candidate peersin this cell with |ΔB|;2-2. If there is no peer satisfying Bp a > |ΔB|, go to Step3, otherwise go to Step 4.Step 3. Choose a peer in this cell according to serviceability:3-1. Choose a peer with the highest service ability in thiscell;3-2. Calculate Lest for this cell according to (1),calculate Bpe according to (2);3-3. Recalculate Bs and ΔB, go to Step 1.Step 4. Check all the peers in this cell with Bpe and |ΔB|:4-1. Ca lculate the value of Lest and Bpe for eachcandidate peer that satisfies Bp a > |ΔB| in this cell;4-2. Compare the values of Bpe of all the peers thatsatisfy Bp a > |ΔB| in this cell with |ΔB|;4-3. If there is no peer satisfying Bpe > |ΔB|, go to Step3, otherwise go to Step 5.Step 5. Choose a peer in this cell according to serviceability, Bpe and |ΔB|:5-1. Choose a peer with the highest value of estimatedservice ability from the peers that satisfy Bpe > |ΔB| inthis cell;5-2. Recalculate Bs and ΔB, end the peer selectionprocess.3.2 DBAT -N ALGORITHMDBaT-N algorithm is designed for the case that therequesting peer demands a certain number of selectedpeers. In traditional fixed network environments, filetransfer speed usually increases with more serving peers.However, in mobile cellular network environments, filetransfer speed may not increase as the number of servingpeers increases because it would be bottlenecked by thedownlink bandwidth limitation. So the motivation ofDBaT-N is to choose a certain number of selected peerswhose sum of uplink bandwidth is fitly over Br. Here welist the notations used in this subsection and theirmeanings:
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 56In each peer selection round, Bref can be seen as a fixedtarget of the selected peer’s uplink bandwidth, B’ can beseen as the actually used target of the selected peer’suplink bandwidth since it represents the adjustment ofBref after last peer selection round, and Δb is used torecord the value difference between B’ and a candidatepeer’s estimated uplink bandwidth. So, the basic idea ofDBaT-N can be described as follows. In each peerselection round DBaT-N chooses a peer with uplinkbandwidth close to B’, and in the last round it chooses apeer that makes the sum of selected peers’ uplinkbandwidth fitly over Br according to Δb.In more detail, DBaT-N algorithm works in thefollowing steps:Step 1. Choose a cell:1-1. Sort the cells according to the traffic load;1-2. Choose a cell with the lowest traffic load, go to Step 2.Step 2. Calculate Δb for each peer in this cell:2-1. Calculate the value of Lest and Bpe for eachcandidate peer in this cell;2-2. Calculate B’ = Bref - Δb, then calculate Δb = Bpe-B’ for each candidate peer in this cell;2-3. Check the value of n, if n > 1, go to Step 3, if n= 1,go to Step 4.Step 3. Choose a peer according to service ability, K3-1. Choose a peer with the highest estimated serviceability from the K peers that have the lowest values of|Δb| in this cell;3-2. Record the value of Bpe and Lest for this peer,record the value of Δb, let n = n – 1, go to Step 1.Step 4. Choose a peer according to service ability, K andΔb:4-1. Choose a peer with the highest estimated serviceability from the K peers that have thelowest values of Δb and satisfy Δb > 0 in this cell;4-2. Record the value of Bp e and Lest for this peer,record the value of Δb, end the peer selection process.In Step 4, it is possible that the number of peerssatisfying Δb > 0 (denoted as k here) is lower than K. Inthis case, the algorithm will take k as K in Step 4.Moreover, it is also possible that the value of k is 0.4. FCM FOR ESTIMATION OFPEERS’ SERVICE ABILITYService ability in environments of mobile cellularnetworks:• Uplink Bandwidth. A peer’s uplink bandwidth hasdirect and great impact on its service ability.• Delay. The delay between a peer and the requestingclient will affect the peer’s service ability to some extent.• Packet Loss Probability. According to our simulations,Packet loss probability on the link between a peer andthe requesting client impacts the peer’s service abilitygreatly.• SINR. SINR (Signal to Interference and Noise Ratio)value of a radio link can indicate the radio link qualitywhich has a direct impact on the packet loss probabilityof the link.• Energy Level. Since the battery energy is relativelylimited on mobile hosts, the energy level has a directimpact on peer churn probability which greatly affectsthe peer’s service ability. Moreover, a peer with higherenergy level is expected to stay longer.• Lingering Time. As in we assume that if a peer stayslonger its peer churn probability is lower.• Moving Speed. In mobile environments, a highermoving speed usually means a lower radio link quality,and thus means a higher packet loss probability.Moreover, a peer with higher moving speed often hashigher cell handover probability which affects its serviceability to some extent.4.1 Simple P2P Protocol for Cellular PhonesWe have designed the P2P protocol for cellular phoneswith a simple text format over HTTP, since they canonly support HTTP and cannot process the protocolbased on XML. The P2P protocol for cellular phones isprovided by mobile proxy. Each mobile proxy acts as avirtual peer-to-peer node for a cellular phone andconverts the XML based P2P protocol to the simple P2Pprotocol for the cellular phone. An example of a P2Pmessage for cellular phone is shown in Figure 4. Amessage included in the HTTP body, is written in asimple text format and is composed of two parts. Thefirst part of the message corresponds to the P2P coreprotocol, and the second part corresponds to theapplication protocol.
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 57Figure 4: A sample of P2P message for cellular Phone5. PERFORMANCE EVALUATIONIn this section we evaluate the performance of DBaTalgorithms on our simulation platform built uponOMNet++. Network topology used in the simulations isshown. Where there are 20 cells in total. As shown inFig. 4, we adopt Bit Torrent-like  architecture for theP2P systems used in our simulations.5.1 Simulation SettingsIn our simulations, to simulate a relatively realistic andmoderate initial status, the initial traffic load on each cellis randomly generated in the range of [0.25, 0.75]. Thenumber of requesting peer is 10, and each requestingpeer has 100 candidate peers. So there are totally 1000candidate peers that are randomly distributed in 20 cells.Some parameters of each candidate peer are set asfollows.The delay between a candidate peer and the requestingpeer is randomly generated in the range from 0 to 500ms.The SINR value of a radio link is randomly generated inthe range from 0 to 100dB. The energy level is randomlygenerated in the range from 0 to 5. The lingering time isgenerated by a random number in combination with thevalue of the energy level, and has a range from 0 to 5hours. The packet loss probability of each radio link isgenerated by a random number in combination with theSINR value and the value of the moving speed, and has arange of [0.001, 0.01].Figure 5 .FCM for P2P systems over mobile cellularnetworksMoreover, during the data transmission process, eachserving peer has a probability of peer churn, which isgenerated by the value of the energy level incombination with the value of the lingering time. After apeer churn happens, the churned peer will leave thesystem, and the requesting peer will ask the tracker toreturn a new serving peer to get the remaining data.Furthermore, each serving peer also has a probability ofmoving to a neighboring cell, which is called cellhandover probability and is generated by the value of themoving speed in combination with a random number.After a serving peer move to a neighboring cell, itsparameters including delay, SINR value and packet lossprobability will be regenerated. We evaluate theperformance of DBaT algorithms using a BT-like filesharing process. First, the 10 requesting peers join in thesystem and send requests for files to the Trackersimultaneously. Second, the Tracker performs the samepeer selection algorithm for the 10 requesting peers andreturns them a peer list respectively. Finally, the 10requesting peers receive a file from their own servingpeers respectively. We record the average transfer timeof the 10 files and the Standard Deviation (SD) of thetraffic load on the 20 cells during the file sharingprocess.5.2 Case I: A Lower Bound of the Sum of the SelectedPeers’ Uplink Bandwidth is demandedIn this subsection we consider the case that therequesting peer demands a lower bound of the sumof theselected peers’ uplink bandwidth. We compare theperformance of DBaT-B algorithm with other twoalgorithms. One is called HSA-B Highest ServiceAbility, Bandwidth satisfied), and the other is called RS-B (Random Selection, Bandwidth satisfied). HSA-B is infact the same with the peer selection algorithm thatalways chooses peers with the highest service ability ,P2PFRM 92Source: Node ID of source nodeMulticastGroupID: ID of multicast groupApplicationURI:http://www.mml.yrp.nttdocomo.co.jp/ED/2003/03/p2p_instantmsg_appInstantMessageUserMessage: Hello All!FRMEND
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 58and RS-B is in fact the traditional peer selectionalgorithm used in BitTorrent that chooses peersrandomly .Fig. 6 shows the simulation results under the scenario of3G networks when the downlink bandwidth of eachrequesting peer ranges from 200Kbps to 1Mbps. Theresults can be observed and analyzed as follows.Figure 6: Simulation results under the 3G scenario incase IFirst, with any value of the downlink bandwidth, the SDvalue of DBaT-B is much (at least 66%) lower than thoseof HSA-B and RS-B. This indicates that DBaT-Bachieves much better load balance on the 20 cells thanthe other two algorithms. Second, with any value of thedownlink bandwidth, the average file transfer time ofRS-B is obviously (at least 33%) higher than that ofDBaT-B or HSA-B. This indicates that the service abilityof the serving peers chosen by RS-B is still lower thanthose chosen by DBaT-B or HSA-B, although the sum oftheir uplink bandwidth is over the downlink bandwidthof each requesting peer. Third, as the downlinkbandwidth increases, the difference between the averagefile transfer time of DBaT-B and that of HSA-B getssmaller. This can be explained as follows. When thedownlink bandwidth is small, the number of servingpeers in the systemwill not be great.From the results and analysis in subsection 5.2 we candraw conclusions including:1) Downlink bandwidth limitation has great impact onfile transfer speed;2) Our DBaT algorithms can achieve much better loadbalance on cells than traditional HSA and RS algorithms;3) Our DBaT algorithms can achieve file transfer speedsimilar with that of HSA, especially when the traffic loadon cells is relatively high.6. CONCLUSIONIn this paper we studied the problems of peer selection inP2P file sharing service over mobile cellular networkswith consideration of downlink bandwidth limitation.Our major contribution was to propose two peerselection algorithms (named DBaT-B and DBaT-N) thatcan achieve load balance on cells under the preconditionthat the requesting peer’s demand is satisfied. The twoalgorithms were designed for two different cases of therequesting peer’s demand respectively. Our algorithmstake the requesting peer’s downlink bandwidth as thetarget of the sumof the selected peers’ uplink bandwidth.Compared with the traditional HSA and RS algorithms,our DBaT algorithms can achieve much better loadbalance on cells, and they can also achieve file sharingspeed better than that of RS, or similar with that of HSA,especially when the traffic load on cells is relativelyhigh. So our algorithms can be seen as niceimprovements. Peer-to-peer security will be an importantissue for such an environment. We are considering theincorporation of peer-to-peer security into our mobilepeer-to-peer architecture. Additionally, we continue todevelop new mobile peer-to-peer applications and willevaluate efficiency and performance of our peer-to-peerprotocols.REFERENCES Y. Li, Y. C. Wu, J. Y. Zhang, et al., “A P2PBased Distributed Services Network for NextGeneration Mobile InternetCommunications,” in Proc.WWW’09, pp.1177-1178, 2009. L. Popova, T. Herpel, W. Gerstacker,“Cooperative mobile-to-mobile filedissemination in cellular networks within aunified radio interface,” ComputerNetworks, vol. 52(6), pp. 1153-1165, 24 April2008. H. Xie, R. Yang, A. Krishnamurthy, “P4P:Provider Portal for Applications,” in Proc.ACM SIGCOMM’08, vol. 38, pp. 351-362,2008. 4 W. Li, S. Z. Chen, T. Yu, “UTAPS: AnUnderlying Topology Aware Peer SelectionAlgorithm in BitTorrent,” in Proc. IEEEAINA’08, pp. 539-545, 2008. T. S. Eugene Ng, et al., “Measurement-BasedOptimization Techniques for Bandwidth-
www.ijaret.org Vol. 1, Issue IV, May 2013ISSN 2320-6802INTERNATIONAL JOURNAL FOR ADVANCE RESEARCH INENGINEERING AND TECHNOLOGYWINGS TO YOUR THOUGHTS…..Page 59Demanding Peer-to-Peer Systems,” in Proc.IEEE INFOCOM’03, pp. 539-545, Orlando,Florida, USA, 2003. Bit Torrent, Inc. 2008. URL:http://www.bittorrent.com/ B. Kosko, “Fuzzy Cognitive Maps,”International Journal of Man-MachineStudies, vol. 24, pp. 65-75, 1986. X. Li, H. Ji, F. R. Yu, R. M. Zheng, “A FCM-Based Peer Grouping Scheme for NodeFailure Recovery in Wireless P2P FileSharing,” in Proc. IEEE ICC’09, pp. 1-5,2009. OMNeT++, URL:http://www.omnetpp.org/2011 NTT DoCoMo, Inc., “FOMA (Freedom OfMobile multimedia Access)”,http://foma.nttdocomo.co.jp/English/.ABOUT AUTHOR’SS.UvaraJ is pursuing M. E (CSE) in ArulmiguMeenakshi Amman College of Engineering,Kanchipuram, India. He received under graduate degreefrom “Sri Venkateswara College of Engineering,Chennai, India. He has published two papers ininternational journals. He is member of IAENG,IACSIT & SDIWC. He also attended “WEBSERVICES organized by Thirumalai EngineeringCollege.” His research interests include WirelessNetwork Security & mobile computing.E-Mail: email@example.comS.Suresh is pursuing B.Tech (IT) in “Sri VenkateswaraCollege of Engineering, Chennai, India. He haspublished one paper in international journals. He ismember of IAENG & SDIWC. His research interestsinclude Cryptography & Network Security.E-Mail: firstname.lastname@example.org