搜索资源列表
networking-self-teaching-guide-osi-tcp-ip-lans.ra
- * Manage all the components within a node * Take advantage of the Ethernet, today s most prominent LAN technology * Utilize the most commonly deployed standards and technologies in networking * Ensure that information flows
ST
- spanning tree protocol to find efficeient rout discovery between various nodes.. imperfect code
tcl_code
- TCL code to simulate four wireless nodes and code to calculate node postion and energy.
telnet-server-ipv6
- 这个程序是在uip协议栈上实现的对节点进行telnet操作的程序。通过这个程序可以熟悉uTCP/ip。-This program is implemented uip stack of nodes on the telnet operation procedures. Through this program can be familiar with the uTCP/ip.
wirelessAodv
- wirelss aodv.it is written in rich text format.consist of two nodes.two wireless nodes with tcp udp cbr ftp sink
3-2
- nodes distance algrothim (ping.cc)-nodes distance algrothim (ping.cc)
example4
- packet exchange between nodes using tcp.
Tcl-script-for-implementing-AODV-routing-protocol
- Descr iption: This network consists of 22 nodes. After creating the nam file and trace file, we set up topography object. Set node_ ($i) [$ns node] is used to create the nodes. Here we set the initial position for the every node by using init
Router
- 这是一个模仿路由算法的java程序。 实现关于路由器的简单功能。 实现距离矢量路由算法。 所实现的路由器模拟Internet上的IP路由器。它能确定网络的最短路由，并在这些利用上传输分组 实现功能简介 1) 编写一个称为“Router”的程序 2) 利用距离向量算法更新路由表 3) 该程序的多个实例（进程或线程）可以以运行在一台机器 4) 实例之间利用UDP交换路由表 5) 假设结点与其邻居结点的都为距离为1。 6) 为了指明实例及其邻居，程序启动时必须能
Project-report1
- A wireless network is any type of computer network that uses wireless data connections for connecting network nodes. Wireless networking is a method by which homes, telecommunications networks and enterprise (business) installations avoid the costly
rongliangfenpei
- 星形网络设计环境要求：Windows2000/XP/7 功能要求： 设有n个节点（依次编号为１、２、……，ｎ）和一个中心，每个节点都有ni个终端，每个终端至节点的报文达到率都相等为λ，报文长度都相等为１／μ，确定该网络设计的总容量为C，编写一个程序，对于输入节点数ｎ、ｎｉ、λ、μ，算出网络的最佳容量分配及相应的延时。注意，一条链路的平均延时时间计算参考公式T=1 /(μC-λ)，其中１／μ是以比特为单位的报文分组平均长度；C是以该链路的容量，单位是比特/秒；λ是平均流量，单位是分组/秒
WIFI-performance-simulation
- 基于NS-3的无线网络设备的性能模拟，模拟无线的节点相聚多远不能可靠地通信-Performance analog wireless network device based on the NS-3, analog wireless nodes can communicate reliably meet far
10mobilenodes.tcl
- aodv code for 10fixed nodes
Dijkstra-Algorithm
- Dijkstra s algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later
pnhvt
- Using a large number of finite element method to solve partial differential equations, Matching Pursuit and orthogonal matching pursuit, Using weighted model nodes in the network strength and weight are power law distribution.
4663
- Energy entropy calculation, Using weighted model nodes in the network strength and weight are power law distribution, Jacobi iteration for solving linear equations class-based.
ZStack-CC2530-2.5.1a
- 完整的协议栈demo程序，包括终端节点，协调器节点以及路由节点(Complete protocol stack demo program, including terminal nodes, coordinator nodes and routing nodes)